input: def insertionSort(arr):
  	for i in range(1, len(arr)):
  		current = arr[i]
  		j = i - 1
  		while j >= 0 and arr[j] > current:
  			arr[j + 1] = arr[j]
  			j -= 1
  		arr[j + 1] = current
  	return arr
  
  if __name__ == '__main__':
  	arr = [3, 6, 8, 10, 1, 2]
  	print(insertionSort(arr))
  
  """
  Example 1:
  Input: [3, 6, 8, 10, 1, 2]
  Output: [1, 2, 3, 6, 8, 10]
  
  Example 2:
  Input: [9, 7, 5, 3, 1]
  Output: [1, 3, 5, 7, 9]
  """
output:     if __name__ == '__main__':
  	    arr = [3, 6, 8, 10, 1, 2]
  	    print(insertionSort(arr))
  	    arr = [9, 7, 5, 3, 1]
  	    print(insertionSort(arr))