Open In App
Related Articles

ISRO | ISRO CS 2020 | Question 2

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
Of the following sort algorithms, which has execution time that is least dependent on initial ordering of the input ? (A) Insertion sort (B) Quick sort (C) Merge sort (D) Selection sort

Answer: (C)

Explanation:
  • Insertion Sort gives best case if initial input is already sorted.
  • Quick Sort gives worst case if initial input is already sorted.
  • Selection Sort gives least number of swaps if initial input is already sorted.
  • Merge sort never depend on its initial order of input, does not matter what is input, it always takes O(n log n) time.
So, option (C) is correct.

Quiz of this Question

Last Updated : 10 May, 2020
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads