Chapter 14, Problem 2RE

Explanation of Solution

Code walkthrough:

The below is the code walkthrough of the selection sort algorithm with the array of different length:

Array length being 0 or 1:

• When the value of “i” is equal to “0” then “i<a.length-1” is not true.
• The “for” loop that is present in the sort method will never execute and the array will remain unchanged.

Array length being 2:

• The “for” loop that is present in the sort will execute once.
• When the value of “i=0” then “minimumPosition(a,0)” gets called.
• The “for” loop that is present gets executed from “=i” that is from 1 till less than 2, that is the loop will be executed once.
• The value of “minPos” is initially set to “0”.
• If the value of “a[1] is less than a[0]” then the value of “minPos” will be set to “1”.
• Finally when the method returns the values, two values will be swapped and that will make the array to be sorted...