Insertion Sort Algorithm

Insertion Sort is one of the simplest sort algorithms with quadratic - O(n^2) - running time.

It works the same way most of us sort cards in our hand, every time picking one card and inserting it in the correct position.

In this video, we explain how insertion sort works, implement it in python and see how it sorts an array of numbers.

Chapters:
00:00 - Idea
01:54 - Implementation
03:41 - Illustration
05:49 - Time Complexity
06:39 - Thank You

[bigocast]

Which algorithm would you like to see next?
Let us know in the comment section.