Insertion Sort Explained w/Python Implamentation

Let's spend another Algorithm Monday, looking at insertion sort (and coding in Python)! It's the next obvious step in sorting algorithms after bubble sort, and a great opportunity to contrast the approach both take. Insertion sort is a little better, but still O(n^2). Both easy to understand and implement, it's a great way to continue your computer science and algorithm journey. Don't forget to check out the playlist for more sorting and algorithm fun and make sure to subscribe for future content!
Algorithm Monday Playlist: • Algorithm Monday
Sorting Algorithm Playlist: • Sorting Algorithms
CS Thursday playlist: • Computer Science Thurs...
Algorithm Monday Code: github.com/robertbunch/algori...
0:00 - Introduction and Big O
1:06 - Insertion Sort Algorithm
5:21 - Python Implamentation
12:55 - Insertion Sort vs. 10,000 numbers

[@ahmad-murery]

Well explained Rob!
The only one thing I missed is to pass the same array to the bubble sort function and compare the performance.
See you in the next video

[@kazmi401]

Keep it up Rob. It really helps and helps alot. Thanks again. I Bookmarked the playlist.