Which sorting technique is best for sorting a linked list with n elements?
Show answerHide answer
Correct answer: (C) Merge sort
Explanation
Merge sort suits linked lists: it needs only sequential access, splits the list by moving pointers, merges without extra arrays and runs in O(n log n). Other sorts are O(n²) or need random access.