Question: Write a modified dual version of the selection sort algorithm that selects both the largest and smallest elements on each pass and moves each of
Write a modified “dual” version of the selection sort algorithm that selects both the largest and smallest elements on each pass and moves each of them to the appropriate end of the array. Will this algorithm be faster than the standard selection sort? What predictions would you make about its performance relative to the merge sort algorithm? What will its complexity class (big-Oh) be?
Step by Step Solution
3.50 Rating (157 Votes )
There are 3 Steps involved in it
Places the elements of the given array into sorted order using th... View full answer
Get step-by-step solutions from verified subject matter experts
