You are viewing a single comment's thread. Return to all comments →
#python def insertionSort2(n, arr): for i in range(1, n): while i-1>=0: if arr[i]<arr[i-1]: temp=arr[i] arr[i]=arr[i-1] arr[i-1]=temp i=i-1 else: break print(*arr
Seems like cookies are disabled on this browser, please enable them to open this website
Insertion Sort - Part 2
You are viewing a single comment's thread. Return to all comments →