input: Write a function to sort a list of numbers using the selection sort algorithm.
  
  def sort_list(array): 
      n = len(array) 
    
      for i in range(n): 
    
          min_idx = i 
          for j in range(i+1, n): 
              if array[min_idx] > array[j]: 
                  min_idx = j 
          array[i], array[min_idx] = array[min_idx], array[i]
  
  assert sort_list([4, 2, 6, 7, 1])==[1, 2, 4, 6, 7]
  assert sort_list([3, 5, 1, 2, 4])==[1, 2, 3, 4, 5]
  assert sort_list([9, 8, 7, 6, 5])==[5, 6, 7, 8, 9]
  assert sort_list([1, 2, 3, 4, 5])==[1, 2, 3, 4, 5]
  assert sort_list([])==[]
output: def sort_list(array): 
      n = len(array) 
    
      for i in range(n): 
    
          min_idx = i 
          for j in range(i+1, n): 
              if array[min_idx] > array[j]: 
                  min_idx = j 
          array[i], array[min_idx] = array[min_idx], array[i]