Insertion Sort algorithm in Python

Hello everyone, welcome back to Here am going to tell you how to implement Insertion Sort Algorithm in Python. In the previous posts, I have said about Merge Sort, Selection Sort, and Bubble Sort, here I will show you Insertion Sort which is more efficient than Selection and Bubble sort techniques.

Insertion Sort is an in-place sorting algorithm. Here a sub-list is maintained which always sorted, as the iterations go on, the sorted sub-list grows until all the elements are sorted. In each iteration, an element in the main list(unsorted list) is picked and placed correctly in the sorted list by shifting elements to the right which are greater than the element picked from the unsorted sub-list.

You can also watch the video on YouTube here.

Program on Github

See the below animations,

By Swfung8Own work, CC BY-SA 3.0, Link

By Simpsons contributorOwn work, CC BY-SA 3.0, Link


Time Complexity Of Insertion Sort

Best Case O(n2)
Average Case O(n)
Worst Case O(n2)

Program on Github


Given a list L of n elements with values or records L0, L1, …, Ln-1.

  1. Initially, L0 is the only element in the sorted sub-list.
  2. Compare L1 with the elements in the sorted sub-list(initially L0 and L1), and place it in the correct position(shift all the elements in the sorted sub-list that is greater than the
    value to be sorted)
  3. Repeat until the same step until Ln-1


Program on Github


Insertion Sort Algorithm -
Insertion Sort Algorithm –

Also feel free to look at other sorting algorithms like Bubble Sort or Selection Sort and searching algorithms like Linear Search and Binary Search.

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.