Wednesday, October 7, 2009

Question

Of the following sorting algorithms, which has a running time that is LEAST dependent on the initial ordering of the input?

(A) Insertion sort
(B) Quicksort
(C) Merge sort
(D) Selection sort
(E) Shellsort
Posted by at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)