Welcome to the Treehouse Community
Looking to learn something new?
Insertion sort in python
I am trying to do Insertion sort in python using for loops but unable to get required results. Can someone help me with this. Thanks!
def insertion_sort(A): for i in range(1, len(A)): for j in range(i-1, 0, -1): if A[j] > A[j+1]: A[j], A[j+1] = A[j+1], A[j] else: break
k = [7, 2, 3, 5]
F = insertion_sort(k)