input: Write a function to optimize the sorting of a list of numbers with a time complexity of O(n). The function should take an unsorted list as input and return the sorted list.
  assert sort_list([2, 6, 3, 8, 4]) == [2, 3, 4, 6, 8]
  assert sort_list([9, 1, 5, 7, 2]) == [1, 2, 5, 7, 9]
  assert sort_list([10, 3, 8, 2, 7]) == [2, 3, 7, 8, 10]
  assert sort_list([]) == []
  assert sort_list([1]) == [1]
output: def sort_list(lst):
      return sorted(lst)