Welcome to the Treehouse Community

Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community! While you're at it, check out some resources Treehouse students have shared here.

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.

Start your free trial


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)


1 Answer