input: Write a function to demonstrate a sorting algorithm. The function should take a list of integers as input and return the sorted list in ascending order. If the list is empty, the function should return an empty list.
  assert sort_list([1, 5, 7, 8, 4, 10, 2])==[1, 2, 4, 5, 7, 8, 10]
  assert sort_list([3, 5, 10, 1, 2])==[1, 2, 3, 5, 10]
  assert sort_list([4, 3, 1, 2])==[1, 2, 3, 4]
  assert sort_list([])==[]
output: def sort_list(lst):
      if not lst:
          return []
      return sorted(lst)