input: Write a function to implement a selection sort algorithm that sorts a list of numbers in non-decreasing order. The function should modify the original list and not return a new one. If the given input list is empty, it should return an empty list.
  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([3, 2, 1, 4]) == [1, 2, 3, 4]
  assert sort_list([5, 3, 6, 4, 2]) == [2, 3, 4, 5, 6]
  assert sort_list([1, 2, 3, 4, 5]) == [1, 2, 3, 4, 5]
  assert sort_list([]) == []
  assert sort_list([10, 0, 100, -10]) == [-10, 0, 10, 100]
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]