Open In App
Related Articles

Data Structures | Linked List | Question 4

Improve Article
Save Article
Like Article

Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?


Insertion Sort


Quick Sort


Heap Sort


Merge Sort

Answer: (D)


Both Merge sort and Insertion sort can be used for linked lists. The slow random-access performance of a linked list makes other algorithms (such as quicksort) perform poorly, and others (such as heapsort) completely impossible. Since worst case time complexity of Merge Sort is O(nLogn) and Insertion sort is O(n^2), merge sort is preferred. See following for implementation of merge sort using Linked List.

Quiz of this Question
Please comment below if you find anything wrong in the above post

Last Updated : 28 Jun, 2021
Like Article
Save Article
Similar Reads
Related Tutorials