Merge sort

True/False

Merge sort on linked list take O(n log n) time to sort input of length n. Give proper reasoning

3Comments
shivani @shivani1234
10 Oct 2017 04:32 pm
Shri Shivi @shrishivi
10 Oct 2017 05:36 pm

Have asked for ....merge sort   on linked list

techtud @techtudgate
10 Oct 2017 06:53 pm

T(n)= T(n/2)+T(n/2) + n +n for linked list

On solving,

O(nlogn) ?