input: from typing import List
  
  def insertion_sort(arr: List[int]) -> None:
      """ Sorts a list of n distinct integers using the insertion sort algorithm.
      >>> arr = [64, 34, 25, 12, 22, 11, 90]
      >>> insertion_sort(arr)
      >>> arr
      [11, 12, 22, 25, 34, 64, 90]
      >>> arr = [3, 1, 4, 1, 5, 9, 2, 6, 5]
      >>> insertion_sort(arr)
      >>> arr
      [1, 1, 2, 3, 4, 5, 5, 6, 9]
      """
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