InterviewSolution
Saved Bookmarks
| 1. |
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» | |