Other Assumptions
The only operation used for sorting the list is swapping two keys.
Only adjacent keys can be swapped.
This is true for Insertion Sort and Bubble Sort.
Is it true for Repeated Minimum? What about if we search the remainder of the list in reverse order?