Insertion sort in 2 minutes

Step by step instructions showing how to run insertion sort.
Code: github.com/msa... (different than video, I added this retroactively)
Sources:
1. Data Structures and Abstractions with Java by Frank M. Carrano [www.amazon.com...]
2. en.wikipedia.o...
LinkedIn: / michael-sambol

[@Crowmeir]

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

[@itzmranonymous]

same , his logics are way easier to understand than whats given in standard books

[@Rafael-oq9vu]

nah, it is because during class you were lazy and simply did not want to study

[@congdatt]

which uni are u in ?

[@pulsar.]

took my lecturer 50 mins to explain this bruh

[@slimjimjimslim5923]

LOL my uni Algo sucked. The old professor used chalk and just draw arrows everywhere. And he wonders why the class average of the midterm was 72 XD

[@tiagolopes5652]

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

[@anuragsingh168]

and time saver

[@jhonlawwen2386]

so fucking true

[@DarkSkull-h4q]

He is Straight to the Point 🙂Always

[@dalskiBo]

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

[@ProEpicGuya76c007]

its CS50 though

[@dalskiBo]

Can't see how? Author is Michael. No branding of CS50 anywhere!

[@ProEpicGuya76c007]

@@dalskiBo bruh you actually replied to your 2 year old comment ... REPECT

[@zzzzz9654]

@@dalskiBo He meant CS50 instead of CS500

[@ProEpicGuya76c007]

@@goos6005 it is normal but still...

[@DanT-iu6oc]

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.

[@ArnaudMEURET]

Hours !? 😲

[@awawpogi3036]

Insertion sort is just the improved version of bubble sort

[@lifecodesher5818]

right

[@kartikkalia01]

@@lifecodesher5818 It would have cost you nothing to not say that

[@lifecodesher5818]

@@kartikkalia01 i can say the same for you

[@kartikkalia01]

@@lifecodesher5818 no

[@wdrammeh]

That's right

[@mysticstardust1109]

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

[@SharpSteelz]

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

[@jsteezeful]

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]

[@ilayohana3150]

I'm pretty sure what you wrote here is more efficient than what he had in mind

[@shresthamall9460]

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!

[@prasannas3130]

5 year ago?? I'm still stuck in AVL tree

[@lazio66]

6 years later still fucked

[@RideLikeAChamp]

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

[@liuqing1995]

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!

[@itzmranonymous]

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

[@typingcat]

01:44 That's what she said.

[@anshuman1021]

Wtf😂

[@Mars30999]

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

[@cremegg]

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

[@introvertsenpai9968]

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

[@pragathesi6541]

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

[@NSq12]

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 🤩🤩💕

[@joelblackmore8039]

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

[@dwayneneckles]

Yea I was thinking that as well!

[@DenzelHooke]

@@dwayneneckles Agreed, though once you walk through each pass through it's not terribly difficult to see how it's done. Running right to left in each inner while loop pass thru whilst bubbling the greater value to the beginning of your outter loops starting point -1 for each inner pass through.

[@ethanholland9674]

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

[@jafar_u]

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!

[@maxwendellgarciasantana1854]

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

[@AntiContent]

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

[@Pokemoki]

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

[@MichaelSambol]

Insertion sort in 1 minute

[@louggy2000]

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

[@devildoesstuff]

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

[@PixelBlock1k]

We learnt this in year 8 (now) and I got my eoy test on Tuesday. If this is in the gcses I'll feel alot confident since I decided to take computer science

[@Rahmzzz.1]

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

[@MichaelSambol]

💪🏼❤️

[@seosimba]

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

[@gavinhayes5442]

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

[@ireviewfastforyou]

these videos are timeless, ppl from 2034 gonna be here

[@MichaelSambol]

love it. I sure hope so 😆

[@natesr5373]

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

[@itsOmSarraf]

yup

[@pleasurendhlovu5927]

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

[@serineprotease0105]

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

[@md.abdullahal-mamoon9974]

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.

[@JamesBrodski]

Great video! Thank you so much.

[@jaydeepmojidra133]

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

[@joshjacob7800]

no one can explain it except you thx

[@kumakuma3335]

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

[@spicydoge3847]

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

[@lerneninverschiedenenforme7513]

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.

[@Basement_crusader]

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

[@latedeveloper7836]

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

[@m1lktea780]

bro the vids 2 mins i dont think it needs time stamps

[@sowmyam801]

Really helpful. You saved me a lot of time. Thankyou

[@malignusvonbottershnike563]

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

[@trolltrazer]

Sir your videos are easy to understand

[@morgantillis4987]

Your videos are literally saving my life !!!

[@stephanbotes5865]

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?

[@AlyssaMarie-vr8cc]

Valid question - what distinguishes insertion sort from other sorts is that it does not use 'swap', instead it 'shifts' items to the right. Conceptually it is different than swapping, but in practice, the process essentially does swap numbers similar to other sorting methods. But I think you are correct, the correct code for insertion sort should look like this: INSERTION-SORT(A) 1. for j = 2 to n 2. key ← A [j] 3. // Insert A[j] into the sorted sequence A[1..j-1] 4. j ← i - 1 5. while i > 0 and A[i] > key 6. A[i+1] ← A[i] 7. i ← i - 1 8. A[j+1] ← key

[@stephanbotes5865]

@@AlyssaMarie-vr8cc dope. Thanks

[@aspenboop1844]

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

[@okeuwechue9238]

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.

[@matts8791]

Awesome video, way better than my professor!

[@xeboox]

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

[@Origon09]

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

[@sabrinadhalla]

absolutely love your tutorials....keep going👍

[@mrcrensh3299]

very straight forward and to the point

[@BillAnt]

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.

[@zhangterry1602]

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

[@HologramJay]

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

[@audunoklevik4435]

Really good explanations on these algorithms!

[@kajjkajjkajj]

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

[@Teodrummer92]

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

[@alwardze]

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

[@moazelsawaf2000]

Nice Animation but very abstract explanation

[@PARTHKADAM-o3y]

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

[@viveckmysnoop2650]

Simple and well explained , please upload new tutorial

[@leandromarcelo2340]

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?

[@MichaelSambol]

Keynote and iMovie

[@alexcoulter265]

this guy is the goat

[@huskymotivations]

watching 1 hour before my final. wish me goodluck

[@MichaelSambol]

Crush it!

[@joeld2715]

This channel is a gem

[@victorlarsson4929]

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.

[@neehgurg2111]

It compares it to two and it's bigger

[@bozhidariliev9482]

Agreed. "We see" and "we know" is not how an algorithm works.

[@ahmidahmid9303]

by comparing it to rest of the sorted part to find the correct place

[@bozhidariliev9482]

@@ahmidahmid9303 Just saying that should be in the video, since it's supposed to explain how the algorithm works step by step.

[@antonywhatever572]

0:54 like glaring gole

[@alexsasmrchannel]

Great video, thank you!

[@henryernest5436]

this is still very helpful

[@mohammedghabyen721]

Best tutorial ever, Thanks a lot

[@varunbe09]

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

[@GR4MPI]

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

[@LudwigvanBeethoven2]

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)

[@VndNvwYvvSvv]

That's called binary-search-enhanced [algo name]

[@ArchitecturalAesthetics2046]

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

[@Richard_b24]

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

[@Garfield_Minecraft]

I'm in highschool learning programming and our teacher said that this sorting algorithm is so difficult... bruh, my teacher lied this is the most basic algorithm I just don't know the name for it

[@tamirmoav3774]

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

[@ash_ramen]

is there a reason in the pseudocode you provided that you use both a while loop and a for loop?

[@CapMan275]

Is it just one iteration, or is every time a number is sorted it is an iteration?

[@XaxtonRevolution2]

i’m confused; what you’re explaining looks like Gnome sort. could you please explain the difference?

[@jasmin9943]

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

[@arevikkhachatryan9944]

thank you, its help me understand my code

[@APC9906]

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

[@devangrathod6763]

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

[@tebourbi]

There is no n indice, there is a max of n-1 because it starts counting from 0

[@isabelcerdan4128]

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

[@MichaelSambol]

Will add to my list 👍🏼

[@diegoortega2374]

Amazing dude, thanks a lot!

[@winterfoxx6363]

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?

[@VndNvwYvvSvv]

This is not bubble sort.

[@avt996]

great Tutorials, thanks !

[@kal-abyebeltal7471]

great video! whats the point of the for loop?

[@Anfal910]

What is the difference between bubble sort and insertion sort?

[@youtubeaccount0x073]

What is a O(2^n) algorithm

[@sorenrood]

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

[@Chado111]

Good luck on your midterms everyone!

[@lejuan9002]

Bro demolished universities with a 2-minutes video

[@Mood138]

Great explanation. Thank you.

[@sachinkr.singhal3449]

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

[@mattybear312]

But whats the djfference between Insertion sort and gnome sort

[@WiiHack]

Michael, I love you.

[@rishavjain5087]

that's bubble sort (from cs50) isn't it?