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