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.

References:

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.

[BrianFaure]

Correction: At 4:23, meant to say "once we reach the end of the FOR loop", not WHILE loop.

[MrSimontonSET]

Thanks for amazing videos! In benchmark Insertion sort is faster then Build-in, is it correct?

[eytchde]

0:01 you gonna shove all-in with that pocket flush?

[devapriyadeb]

U speak faster than a bullet train bruhh.... Talk slowly....