Data structures and algorithms insertion sort
#insertion #sort #algorithm
// Insertion sort = after comparing elements to the left,
// shift elements to the right to make room to insert a value
// Quadratic time O(n^2)
// small data set = decent
// large data set = BAD
// Less steps than Bubble sort
// Best case is O(n) compared to Selection sort O(n^2)
music credits 🎼 :
===========================================================
Take It Easy - by Bad Snacks
link: https://youtu.be/UxvSQ0u_-OU
===========================================================
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
