Consider the following statement:
S1: Merge sort on linked list take O(n log n) time to sort input of length n.
S2: Merge sort on linked list give better space complexity then on array.
S3: Inplace merge sort on array will take O(n2) time.
Which of the following is correct?
b)S1 and S2
@kunal ,see this
How S1 and S2 are not correct ?
@sushmita Yes, BITS Pilani is really nice. I ...
yeah, the list will be divided into 3 equal ...