input: Write a function to sort a list using the provided algorithm.
  assert sortList([14, 2, 3, 12, 15, 8]) == [2, 3, 8, 12, 14, 15]
  assert sortList([5, 3, 1, 4, 2]) == [1, 2, 3, 4, 5]
  assert sortList([10, 9, 8, 7, 6, 5]) == [5, 6, 7, 8, 9, 10]
output: def sortList(lst):
      # Using the Bubble Sort algorithm for sorting the list
      n = len(lst)
      for i in range(n):
          for j in range(0, n-i-1):
              if lst[j] > lst[j+1]:
                  lst[j], lst[j+1] = lst[j+1], lst[j]
      return lst