input: Write a function to sort a list of numbers using the selection sort algorithm. The function should modify the input array in place and not return anything.
  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])==None
  assert sort_list([5, 3, 8, 1, 2])==None
  assert sort_list([9, 7, 5, 3, 1])==None
  assert sort_list([])==None
  assert sort_list([1])==None
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]