input: from typing import List
  
  def insertion_sort(list: List[int]) -> List[int]:
      """
      Implement an insertion sort algorithm that sorts a list of integers in ascending order.
  
      >>> insertion_sort([5, 3, 8, 4, 2])
      [2, 3, 4, 5, 8]
      >>> insertion_sort([10, -1, 3, 9, 2, 27, 8, 5, 1, 3, 0, 26])
      [-1, 0, 1, 2, 3, 3, 5, 8, 9, 10, 26, 27]
      >>> insertion_sort([])
      []
      >>> insertion_sort([7, -2, 4, 1, 6, 5, 0, -4, 2])
      [-4, -2, 0, 1, 2, 4, 5, 6, 7]
      """
      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