what is the time complexity of an algorithm to merge 2 posted lists of size m and n ?
complexity
merge how?
| akshar wrote: |
| what is the time complexity of an algorithm to merge 2 posted lists of size m and n ? |
It depends on the assortment technique ... however if thought linearly then the time complexity would be O(n)(m).
I am not getting an expected answer
 |