MadeEasy Test Series: Algorithms - Time Complexity

Question

For merging two unsorted list of size m and n into sorted list of size (m+n). The time complexity in terms of no. of comparison for this is?

Comments

mlogm+nlogn i think as we have to first sort it then merge.

---

But comparisons will be m+n-1

Answer 1

First, sort the lists and then merge them all together into the sorted one.

Time Complexity : O (nlogn + mlogm + (n + m))