Answer TRUE or FALSE.
Selection Sort (as the code is written in this module) is a stable sorting algorithm. Recall that a stable sorting algorithm maintains the relative order of records with equal keys.
Think of the behaviour of every pass through the inner for loop of Selection Sort if two records are equal, with the greatest value in the array.
Which record will be selected?
The first such record.
Where will it be moved to?
The last position in the array.