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
s3: in place mergesort on array .will take O(n^{2}) ( true)
ryt .??
@kunal ,see this
http://www.geeksforgeeks.org/merge-sort-for-linked-list/
How S1 and S2 are not correct ?
23706 Points
17298 Points
9336 Points
6566 Points
5478 Points
5188 Points
4910 Points
4514 Points
4158 Points
4098 Points
Gatecse
X->YZ , Y->XZ , ...