input: Write a function to perform insertion sort using iteration.
  assert recursiveInsertionSort([5, 2, 9, 1, 5, 6]) == [1, 2, 5, 5, 6, 9]
  assert recursiveInsertionSort([3, 0, 2, 5, -1, 4, 1]) == [-1, 0, 1, 2, 3, 4, 5]
  assert recursiveInsertionSort([1, 2, 3, 4, 5]) == [1, 2, 3, 4, 5]
  assert recursiveInsertionSort([5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5]
output: def iterativeInsertionSort(arr):
      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
  
  assert iterativeInsertionSort([5, 2, 9, 1, 5, 6]) == [1, 2, 5, 5, 6, 9]
  assert iterativeInsertionSort([3, 0, 2, 5, -1, 4, 1]) == [-1, 0, 1, 2, 3, 4, 5]
  assert iterativeInsertionSort([1, 2, 3, 4, 5]) == [1, 2, 3, 4, 5]
  assert iterativeInsertionSort([5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5]