input: Write a function to generate a python program that sorts a given list of numbers using the selection sort algorithm. The function should modify the input list in place and not return any value.
  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]
  
  if __name__ == "__main__":
      array = [4, 2, 6, 7, 1]
      sort_list(array)
      print(array)
  assert sort_list([4, 2, 6, 7, 1])==[1, 2, 4, 6, 7]
  assert sort_list([9, 3, 5, 1, 8])==[1, 3, 5, 8, 9]
  assert sort_list([7, 2, 0, 4, 6])==[0, 2, 4, 6, 7]
  assert sort_list([])==[]
  assert sort_list([1])==[1]
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]