input: Write a function that sorts a list of numbers in ascending order using selection sort algorithm. The function should take a list as input and modify the list in place to sort it. If the list is empty, it should remain empty.
  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([5, 3, 8, 6, 7, 2])==[2, 3, 5, 6, 7, 8]
  assert sort_list([10, -1, 3, 9, 2, 27])==[-1, 2, 3, 9, 10, 27]
  assert sort_list([1])==[1]
  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]