Insertion Sort: Background & Python Code 

In this video we'll continue our series covering sorting algorithms by introducing the Insertion Sort, another simple approach to sorting lists and arrays.
If you'd like to learn about Python data structures, check out my video series starting with: ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-TW_e9FFEDeY.html
Video series covering GUI development in Python: ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-IpTG4KixVew.html
References:
[1] bigocheatsheet.com/
[2] en.wikipedia.org/wiki/Insertion_sort
End song is "Deep Sky Blue" by Graphiqs Groove.
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.