You are viewing a single comment's thread. Return to all comments →
def insertion_sort(ar):
for i in range(1, len(ar)): for j in range(i): if (ar[i]<ar[j]): k = ar[i] ar[i] = ar[j] ar[j] = k print(*ar)
Insertion Sort - Part 2
You are viewing a single comment's thread. Return to all comments →
def insertion_sort(ar):