Which sorting algorithm is most suitable for sorting a singly linked list in…
2025
Which sorting algorithm is most suitable for sorting a singly linked list in ascending order in terms of both time and space complexity?
Answer: B. Merge Sort — Merge Sort is optimal for singly linked lists with O(n log n) time and O(1) extra space.
- A.
Heap Sort
- B.
Merge Sort
- C.
Quick Sort
- D.
Bubble Sort
Attempted by 334 students.
Show answer & explanation
Correct answer: B
Merge Sort is optimal for singly linked lists with O(n log n) time and O(1) extra space.
Loading lesson…