You are viewing a single comment's thread. Return to all comments →
Here is my python3 solution.....
def insertionSort2(n, arr): for i in range(1,n): for j in range(i): if(arr[i]<arr[j]): arr[i],arr[j]=arr[j],arr[i] 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 →
Here is my python3 solution.....