Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?
- A.Insertion Sort
- B.Quick Sort
- C.Heap Sort
- D.Merge Sort
Show answer
Answer: D. Merge Sort
Merge Sort is best suited for linked lists, achieving O(n log n) time complexity without requiring random access.