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 Officer (IT) October 2024 – Preliminary (BIBM) exam, question 73 of 95.

More from this paper

Previous: Given a hash table with 25 slots that stores 2000 elements, the load factor for the hash table is-
Next: Which of the following symbol table implementation is best suited if access time is to be minimum?
All questions in Combined Bank Officer (IT) October 2024 – Preliminary (BIBM)