Pick wisely
Computer Science
Level
2
Which type of sorting technique is best for sorting a linked list?
Do you know why?
Heap sort
Quick sort
Merge sort
Insertion sort
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Since a linked list is a linear collection of data elements, whose order is not given by their physical placement in memory, a merge sort would be the one to sort a linked list as a merge sort is a comparison-based algorithm.