Selection Sort

Another sorting algorithm we never covered in-depth is called "selection sort". It's similar to bubble sort in that it works by repeatedly swapping items in a list. However, it's slightly more efficient than bubble sort because it only makes one swap per iteration.

Selection sort pseudocode:

1. For each index:
   1. Set smallest_idx to the current index (of the outer loop)
   2. For each index from i + 1 to the end of the list:
      1. If the number at the inner loop index is smaller than the number at smallest_idx, set smallest_idx to the inner loop index
   3. Swap the number at the outer loop index with the number at smallest_idx
2. Return the sorted list

Assignment

Complete the selection_sort function.

It should sort the input list nums in ascending order using the selection sort algorithm. The function should then return the sorted list