Linked List with Merge Sort Is Merge Sort the best sorting technique to sort a linked list? Also, which sorting technique is worst for a linked list?



Merge sort uses a divide and conquer method. What makes merge sort efficient for sorting a linked list?
It is really inefficient to access a certain index in a linked list, which is what many sorting algorithms rely on. MergeSort, however, divides and merges lists, which LLs do efficiently. You can find some code and an explanation here.