Consider the following statement: S_{1}: Merge sort on linked list take O(n log n) time to sort input of length n. S_{2}: Merge sort on linked list give better space complexity then on array. S_{3}: Inplace merge sort on array will take O(n^{2}) time. Which of the following is correct?
a)S_{1}
b)S_{1} and S_{2}
c)S_{1},S_{2},S_{3}
d) None
@kunal ,see this
http://www.geeksforgeeks.org/merge-sort-for-linked-list/
How S1 and S2 are not correct ?
3154 Points
1630 Points
1590 Points
1350 Points
1246 Points
1044 Points
1022 Points
972 Points
836 Points
692 Points
256 Points
236 Points
114 Points
94 Points
Gatecse
@sushmita Yes, BITS Pilani is really nice. I ...
yeah, the list will be divided into 3 equal ...