Shri Shivi @shrishivi added a Question 10 Oct 2017 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 thumbs up down up0 like shivani @shivani1234 10 Oct 2017 04:32 pm it is true u can refer : https://stackoverflow.com/questions/7801861/why-is-merge-sort-worst-case... up0 like Log in or register to post comments Shri Shivi @shrishivi 10 Oct 2017 05:36 pm Have asked for ....merge sort on linked list up0 like Log in or register to post comments 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) ? up0 like Log in or register to post comments

it is true

u can refer : https://stackoverflow.com/questions/7801861/why-is-merge-sort-worst-case...

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

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

On solving,

O(nlogn) ?