input: Write a python function to sort a list of numbers using a nested loop.
  assert sorting_algorithm([3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]) == [1, 1, 2, 3, 3, 4, 5, 5, 5, 6, 9]
  assert sorting_algorithm([10, 3, 15, 7, 8, 23, 74, 18]) == [3, 7, 8, 10, 15, 18, 23, 74]
  assert sorting_algorithm([5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5]
output: def sorting_algorithm(arr):
      n = len(arr)
      for i in range(n):
          for j in range(0, n-i-1):
              if arr[j] > arr[j+1]:
                  arr[j], arr[j+1] = arr[j+1], arr[j]
      return arr