input: from typing import List
  
  def insertion_sort(arr: List[int]) -> List[int]:
      """ Sorts a list of n distinct integers using the insertion sort algorithm.
      >>> insertion_sort([64, 34, 25, 12, 22, 11, 90])
      [11, 12, 22, 25, 34, 64, 90]
      >>> insertion_sort([5, 3, 8, 4, 2])
      [2, 3, 4, 5, 8]
      """
      for i in range(1, len(arr)): 
          key = arr[i] 
          j = i-1
          while j >= 0 and key < arr[j] : 
                  arr[j + 1] = arr[j] 
                  j -= 1
          arr[j + 1] = key
      return arr
output:     for i in range(1, len(arr)): 
          key = arr[i] 
          j = i-1
          while j >= 0 and key < arr[j] : 
                  arr[j + 1] = arr[j] 
                  j -= 1
          arr[j + 1] = key
      return arr