input: Write a function to implement a sorting algorithm in Python. The function should take in a list of integers and return a sorted version of that 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([3, 2, 1])==[1, 2, 3]
  assert sort_list([9, 8, 7, 6, 5, 4, 3, 2, 1])==[1, 2, 3, 4, 5, 6, 7, 8, 9]
  assert sort_list([])==[]
  assert sort_list([5])==[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