Which of the following sort algorithms has execution time that is least dependent on initial ordering of the input?

Which of the following sort algorithms has execution time that is least dependent on initial ordering of the input?

  1. a) Merge Sort
  2. b) Insertion Sort
  3. c) Selection Sort
  4. d) Quick Sort

From the BREB Assistant Programmer 2023 – Written exam, question 8 of 20.

More from this paper