Insertion sort in 2 minutes 

7 years later and this is still so much better than what I had at my university, thank you so much!

Your videos sum up my classes in just a couple of minutes. Amazing work!! Life saver!

These fucking videos are goddamn incredible. My god, Michael, this is just absolutely mind-blowing that you can illustrate in 2:18 what I've been wrestling with for the past few hours.

Better explained than the CS500 tutorial (Harvard), thanks Michael.

Insertion sort is just the improved version of bubble sort

XD i can't believed i was so confused about this 3 mins ago

Thank you very much! Python code: A = [2,8,5,3,9,4] for i in range(len(A)): pointer = A[i] left = A[i-1] print(f"Array: {A}") while i > 0 and left > pointer: print(f" Swapping {pointer} & {left}") A[i], A[i-1] = left, pointer pointer, left = A[i-1], A[i-2] i -= 1 else: print(f" Done") else: print(f"Results: {A}") Output: Array: [2, 8, 5, 3, 9, 4] Done Array: [2, 8, 5, 3, 9, 4] Done Array: [2, 8, 5, 3, 9, 4] Swapping 5 & 8 Done Array: [2, 5, 8, 3, 9, 4] Swapping 3 & 8 Swapping 3 & 5 Done Array: [2, 3, 5, 8, 9, 4] Done Array: [2, 3, 5, 8, 9, 4] Swapping 4 & 9 Swapping 4 & 8 Swapping 4 & 5 Done Results: [2, 3, 4, 5, 8, 9]

wow so straight forward and clear and concise exactly the opposite of my teachers lecture notes haha

I played this at 2x speed so I could learn it in 1 minute then spent all my free time typing this comment

Watching this at 1 AM and it's totally worth it!

Fantastic, love it, please consider posting such incredible, crisp yet easy to digest videos on data structures and algorithms

You're doing students a great favour, thank you :)

Very clear, but I would have loved a walkthrough of the pseudocode solution and how that implements what you described in the first part of the video

Hey, great videos! I don't know if you're still actively making videos or not, nevertheless, I will suggest a few topics for you to cover. * B-Trees * AVL-Trees * Priority Queue Thank you again for your wonderful work!

Wow, my lecturer spent 5 minutes confusing me in terms of what is insertion sort. Now I am here and develop a better understanding of insertion sort in 2 minutes!

You are a god send for these videos. Explaining perfectly in 3mins for what took my teacher 30

Watching it 7 yEARS Later and this video is worth it . Its Logic is so simple and can be understood at single glance

Love this, got my last GCSE computing exam tommorow this is very helpful and concise

You are incredable, man! This playlist is the best i've ever seen! Congrats!! And thank you so much!

Bro your helping and saving my A Levels with these. Keep it up and thanks a lot. Underrated.

This two minute video is better than every single long article or video on the same subject. Thanks!

Omg, thanks a lot man, I understood all types of sorts in less than 15 minutes, while my stupid professor spent several weeks. You are awesome!

Thank you from my heart ❤️❤️🤩🤩.... You literally saved my Lab Exam... I didn't know anything about Insertion sort and could get time only to watch your video... Your video was amazing and helped me do program of insertion sort for by Data Structures Lab Exam... The program ran without a bug and the whole credits for u 🤩🤩💕

have never seen anything more simple and easy to understand. Ridiculously simple!

as a biology student freaking out in an intro cs course, thank you LMAOOOO

This video is easier to understand than my prof’s lecture notes, powerpoints, and examples. Thank you sir

Excellent. If you can please make videos on greedy technique and dynamic programming. Thanks again

Great video! Thank you so much.

Anyone else here for paper 2 in a couple hours 😭🙏

no one can explain it except you thx

Hi Michael ur explains is very clear and short. Nice work. correct me if I'm wrong. @1:52 The part for i :1 to length(A) - 1

Thank you so much im pullin an all nighter to study for finals and this explains it perfectly and its straight to the point so i can easily understand

All u r video explanation in just 2 min, it's too amazing:))

these videos are timeless, ppl from 2034 gonna be here

awsome video, love the fact you include the time efficiency.

Watched an 8 minutes video & couldn't understand a thing, then I came to you🔥🔥🔥

thanks man,, best videos to refer to before exams

0:10 Explanation 0:29 Demo 1:50 Pseudocode 1:54 Big O Notation for an Insertion Sort

Great video ! After your explanation it was very easy for me to transform the sorting logic into code.

Your videos are great. After a long day of trying hard I understood your video. Please make a video on linked list stack queue and so on. Please. And thanks alot.

Your videos are literally saving my life !!!

Hey! Thanks for the video! I really appreciate it! Just a quick question on the code in the end: Are you sure that's an insertion sorting code because it seems as though the code only swaps two numbers into the right order other than taking one number and moving it to where it should be?

absolutely love your tutorials....keep going👍

you don't know how much you helped me dude thanks a lot!

How do we know that 5 has to be after 2? Some detail regarding how the algoritm places it in the correct index of "assorted" values would be needed. This video explained a lot. But not everything so I still had to find something better.

Sir your videos are easy to understand

You're the algo animation goat. Subbed and thank you.

0/10 not an Indian guy with a broken microphone. In all honesty this is quite helpful

Very clear, managed to implement it pretty quickly in Python. Thanks :-)

Awesome video, way better than my professor!

Bubble sort is similar but you only swap one position at a time with multiple passes which is more efficient than insertion sort. Quick sort uses a pivot point for left and right sorting with regression at the end which is the most efficient of the three.

Damn this is much better than what we learn in class for a fucking hr

Suggestion for the title: "Insertion sort by example in 2 minutes". Content is awesome! Thanks for the effort! And another improvement: I would never use i and j in the same space, as they are easy to misread. Instead, use i and p.

you're doing students a great FLAVOR

Thank god I found this I am so lost in computer science thanks Michael

very straight forward and to the point

Really good explanations on these algorithms!

Thnx for the vid. Very clear. However, I'm not sure why your code is "swapping" the two elements *within* the loop. The advantage of InsertionSort is that there is actually no swapping at all being done inside the loop - there is simply a *shift* operation. The swap happens(i.e. completes) at the end right after the loop completes using the previously-cached element value.

Great one!!!....Please post more content like this.... :)

Unlike other sorting algorithms. I actually believe I can implement this 😂

Thanks so much dude!!!! explaining so well sorting algorithms!!!

This channel is a gem

What if you use binary search on sorted part of the array instead of comparing with each item? Would that become O(n log n)

this is still very helpful

if only i found you before i took data structures:(

Nice Animation but very abstract explanation

Hey Michael, love your videos. They are of clear and simple to understand. Have you worked on a video on binary search-insertion sort? using recursion on the binary part. Thanks

Best tutorial ever, Thanks a lot

this guy is the goat

Simple and well explained , please upload new tutorial

hello, I loved your video and I would like to know how you do the animations of the arrangements and such, what kind of tools and/or technologies do you use?

You should explain about insertion sort using shifting elements, it will definitely save cost of swapping.

You should consider doing a video on Union Find for Algorithms .

I love your videos! thank u for sharing them with us! could you maybe make a video about hashtables?

very good tutorials

Amazing dude, thanks a lot!

thank you, its help me understand my code

beautifully explained. the language-agnostic pseudocode helped a ton.

great Tutorials, thanks !

Thank you again for these videos. Could you make a video comparing the O of all sorting methods, please?

Hey there, I have some great news that you'll be thrilled to hear!

watching 1 hour before my final. wish me goodluck

this was really helpful, thank you so much!

Gr8 video... tnx.... easy to learn

Michael, I love you.

Simple as it gets 😎 Earned a sub❤️

Another great sorting video! i think what would have been even better is if it showed the visual of each interger "bubbling down" until it was in place, rather than just inserting, but I do see how it emphasizes the name as "insert," it just doesn't highlight the implementation as well. Are there ways to do insertion sort that don't include bubbling down?

There is a mistake in the algorithm. We need to use a for loop from 1 to n, not from 1 to n-1.

perfect explanation!!!😊

Bro demolished universities with a 2-minutes video

isnt it o (n* log n) ? cause it seems that u have to search in a sorted collection each time you need to locate un fit value

So there will be more comparisons than swaps, because whenever you want to swap, you need first to compare, am i right ?

Thanks for keeping it simple. Is the code at the end python?

What is a O(2^n) algorithm

great videos

excellent, comrade.

Perfect explanation

Easily explained ty!

Bro.U are Goat honsetly

great video! whats the point of the for loop?