Reply To:

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

Home Modern › Forums › ISRO ›

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

› Reply To:

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