Selection Sort Revisited
Recall the Selection Sort algorithm from chapter 4:
- Start with n unsorted numbers
- Scan n numbers for largest; remove and store it
- Scan n-1 numbers for second largest;
remove and store it next to largest
- Scan n-2 numbers for third largest;
remove and store it next to second largest
- Continue till no more numbers to scan