input: Write a function to sort a list of numbers using the selection sort algorithm. If the input list is empty, the function should return an empty list.
  def sort_list(array): 
      if not array:
          return 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([8, 5, 3, 6, 2]) == [2, 3, 5, 6, 8]
  assert sort_list([]) == []
output: def sort_list(array): 
      if not array:
          return 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]
      return array