Consider what happens if someone accidently calls sort on a file that is already sorted. Which of the following sorting methods will be the most effecient if the input is already in sorted order.
Which algorithm will make an iteration "quit early" depending on the values seen during comparisons?