Bookies

Question

Which of the following algorithm is best suitable for sorting of linked list?

A) Quick

B) Merge

C) Heap

D) None

Comments

is this Heap?

bcz Heapify min heap LL required logn

replace first element to last means sort means delete min required O(1)

---

This might help https://www.geeksforgeeks.org/merge-sort-for-linked-list/

Answer 1

Merge Sort is often the Best choice for sorting a linked list. Merge sort is a stable sort and it is nore efficient at handling slow-to-access sequential memory. It has the best worst case time complexity among the given i.e O(nlogn).

Random Access Performance makes quick sort perform poorly(selection of pivot and then the movement)and Heap sort is not possible to be implemented in O(nlogn) on a linked list.