input: Write a function to sort a list using a sorting algorithm. The function should use a nested loop to find the minimum element in the unsorted part of the list and swap it with the first element of the unsorted part. The function should return the sorted list. If the input list is empty, the function should return an empty 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, 1, 8, 2, 5])==[1, 2, 3, 5, 6, 8, 9]
  assert sort_list([3, 3, 3, 3, 3])==[3, 3, 3, 3, 3]
  assert sort_list([])==[]
  assert sort_list([1])==[1]
output: def sort_list(mylist):
   for i in range(len(mylist)):
    min_index = 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], mylist[i]
   return mylist