input: Write a function to implement a sorting algorithm that sorts a given list in ascending order using the selection sort method. The function should return the sorted list. 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([]) == []
output: def sort_list(lst):
      if not lst:
          return []
      for i in range(len(lst)):
          min_idx = i
          for j in range(i+1, len(lst)):
              if lst[j] < lst[min_idx]:
                  min_idx = j
          lst[i], lst[min_idx] = lst[min_idx], lst[i]
      return lst