input: Write a function to implement a sorting algorithm that sorts a given list in non-decreasing order. The function should return the sorted list. If the input list is empty, the function should return an empty list.
  assert sort_list([])==[]
  assert sort_list([1, 5, 7, 8, 4, 10, 2])==[1, 2, 4, 5, 7, 8, 10]
  assert sort_list([3, 2, 1])==[1, 2, 3]
  assert sort_list([10, -1, 3, 9, 2, 27, 8, 5, 1, 3, 0, 26])==[-1, 0, 1, 2, 3, 3, 5, 8, 9, 10, 26, 27]
  assert sort_list([5, 4, 3, 2, 1])==[1, 2, 3, 4, 5]
output: def sort_list(lst):
      return sorted(lst)