Question

Can Merge Sort Time Complexity be O(n^2) in any condition?

Comments

@Shubhanshu no it's O[nlogn] see this it will be clear. https://www.geeksforgeeks.org/merge-sort-for-linked-list/

---

Thanks.

By default MS on LL is inplace only. But on array it is outplace.

---

What's in place and out place in merge sort?