Welcome to the Treehouse Community

The Treehouse Community is a meeting place for developers, designers, and programmers of all backgrounds and skill levels to get support. Collaborate here on code errors or bugs that you need feedback on, or asking for an extra set of eyes on your latest project. Join thousands of Treehouse students and alumni in the community today. (Note: Only Treehouse students can comment or ask questions, but non-students are welcome to browse our conversations.)

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and a supportive community. Start your free trial today.


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