input: Write a function to implement a selection sort algorithm on a given list. The function should return the sorted list.
  def sort_list(mylist):
      for i in range(len(mylist)):
          min_index = i
          temp = mylist[i]
          for j in range(i + 1, len(mylist)):
              if mylist[min_index] > mylist[j]:
                  min_index = j
          mylist[i] = mylist[min_index]
          mylist[min_index] = temp
      return mylist
  
  assert sort_list([1, 5, 7, 8, 4, 10, 2]) == [1, 2, 4, 5, 7, 8, 10]
  assert sort_list([9, 3, 6, 2, 8, 1]) == [1, 2, 3, 6, 8, 9]
  assert sort_list([]) == []
  assert sort_list([5, -1, 3, 2, -4]) == [-4, -1, 2, 3, 5]
output: def sort_list(mylist):
      for i in range(len(mylist)):
          min_index = i
          temp = mylist[i]
          for j in range(i + 1, len(mylist)):
              if mylist[min_index] > mylist[j]:
                  min_index = j
          mylist[i] = mylist[min_index]
          mylist[min_index] = temp
      return mylist