Hi everyone! In this video, I will explain insertion sort with two easy examples with input arrays. Then, I will go through the code of insertion sort with Python.

Insertion sort is one of the easiest algorithms used for sorting numbers in an array. It has the worst case time complexity of O(n^2), where n is the size of the array to be sorted. Pretty much all computer science students will learn to sort through numbers in the Data Structures and Algorithms course, just like insertion sort. However, it is not the fastest sorting technique, as quick sort is way more efficient and faster.

In the next video, I will go over selection sort, bubble sort, then merge sort, and finally quick sort, respectively. The interesting thing is that bubble sort is actually the opposite of insertion sort. So stay tuned!

Please leave a like and subscribe if you found this video helpful!

See other sorting algorithms in my Data Structure and Algorithms playlist: [ Ссылка ]

LIKE & SUBSCRIBE:
🔴 My Channel: www.youtube.com/c/QuocDatPhung
🔴 My second channel: [ Ссылка ]

MY EQUIPMENT:
✅Camera: Samsung Galaxy J7
✅Recording Equipment: [ Ссылка ]
✅Editing Software: Shotcut

свернуть