Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Python Program for Insertion Sort

  • Difficulty Level : Easy
  • Last Updated : 30 Dec, 2020

Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands.

# Python program for implementation of Insertion Sort
# Function to do insertion sort
def insertionSort(arr):
    # Traverse through 1 to len(arr)
    for i in range(1, len(arr)):
        key = arr[i]
        # Move elements of arr[0..i-1], that are
        # greater than key, to one position ahead
        # of their current position
        j = i-1
        while j >=0 and key < arr[j] :
                arr[j+1] = arr[j]
                j -= 1
        arr[j+1] = key
# Driver code to test above
arr = [12, 11, 13, 5, 6]
print ("Sorted array is:")
for i in range(len(arr)):
    print ("%d" %arr[i])
# This code is contributed by Mohit Kumra


Sorted array is:

Please refer complete article on Insertion Sort for more details!

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!