def insertion_sort1(A):
	for i in range(1, len(A)):
		for j in range(i-1, -1, -1):
			if A[j] > A[j+1]:
				A[j], A[j+1] = A[j+1], A[j]
			else:
				break

arr = [10, 7, 8, 9, 1, 5]
insertion_sort1(arr)
print(arr)