input: Write a function to implement a selection sort algorithm on a given list. The function should take a list as input and return the sorted list.
  assert sort_list([1, 5, 7, 8, 4, 10, 2])==[1, 2, 4, 5, 7, 8, 10]
  assert sort_list([3, 2, 1, 0])==[0, 1, 2, 3]
  assert sort_list([])==[]
  assert sort_list([5, 3, 8, 1, 2])==[1, 2, 3, 5, 8]
  assert sort_list([1, 2, 3, 4, 5])==[1, 2, 3, 4, 5]
output: def sort_list(lst):
      for i in range(len(lst)):
          min_idx = i
          for j in range(i+1, len(lst)):
              if lst[j] < lst[min_idx]:
                  min_idx = j
          lst[i], lst[min_idx] = lst[min_idx], lst[i]
      return lst