Insertion Sort

insertion_sort.py

# Insertion sort
def Insertion_sort(arr, itr):
  lgth = len(arr)
  for i in range(1,lgth):
    x,j = arr[i],i-1
    while j>=0 and arr[j]>x:
        arr[j+1] = arr[j]
        j-=1
        arr[j+1] = x
        print("Iteration:",i,arr)
        itr+=1
  return arr, itr

if __name__ == '__main__':
	# arr = list(map(int, input("Enter array:").split()))
	arr = [5,4,3,2,1]
	sorted_arr, itr = Insertion_sort(arr, itr=0)
	print("Total Iterations/Swaps:",itr)