Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

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

From the Combined Bank Assistant Programmer (CSE) February 2024 – Written (BIBM) exam, question 29 of 41.

More from this paper

Previous: Which one is the first search engine?
Next: Let P be a singly linked list. Let Q be the pointer to an intermediate node x in the list. What is the worst-case time complexity of the…
All questions in Combined Bank Assistant Programmer (CSE) February 2024 – Written (BIBM)