Question: The selection sort algorithm could be modified to stop when the unsorted section of the list contains only one number, because that one number must

The selection sort algorithm could be modified to stop when the unsorted section of the list contains only one number, because that one number must be in the correct position. Show that this modification would have no effect on the number of comparisons required to sort an n- element list
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
