Merge Sort a singly Linked List

sorting-algorithms
merge-sort
data-structure
linked-list

(Team) #1

Merge sort is a fast comparison based sorting algorithm which can be utilized in sorting a Linked List as well. Merge Sort is preferred for sorting a linked list. The slow random-access performance of a linked list makes some other algorithms such as Quick Sort perform poorly, and others such as Heap Sort completely impossible.


This is a companion discussion topic for the original entry at http://iq.opengenus.org/merge-sort-a-singly-linked-list/