input: 
  def insertion_sort(list):
      """
      Given a list of numbers, sorts the list in ascending order using the insertion sort algorithm.
      >>> insertion_sort([5, 3, 6, 2, 10])
      [2, 3, 5, 6, 10]
      >>> insertion_sort([10, 9, 8, 7, 6])
      [6, 7, 8, 9, 10]
      >>> insertion_sort([1, 2, 3, 4, 5])
      [1, 2, 3, 4, 5]
      >>> insertion_sort([])
      []
      >>> insertion_sort([42])
      [42]
      """
      for i in range(1, len(list)):
          key = list[i]
          j = i - 1
          while j >= 0 and key < list[j]:
              list[j + 1] = list[j]
              j -= 1
          list[j + 1] = key
      return list
  
output:     for i in range(1, len(list)):
          key = list[i]
          j = i - 1
          while j >= 0 and key < list[j]:
              list[j + 1] = list[j]
              j -= 1
          list[j + 1] = key
      return list