Learn Insertion Sort in 7 minutes 🧩 

public class Main{ // 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) public static void main(String[] args) { int array[] = {9, 1, 8, 2, 7, 3, 6, 5, 4}; insertionSort(array); for(int i : array) { System.out.print(i + " "); } } private static void insertionSort(int[] array) { for(int i = 1; i < array.length; i++) { int temp = array[i]; int j = i - 1; while(j >= 0 && array[j] > temp) { array[j + 1] = array[j]; j--; } array[j + 1] = temp; } } }

This finally made insertion sort click for me (i have a test tomorrow, pray for me brothers)

Man I can not explain how much I love and appreciate the work you do on this channel.

And it took me 2 hours to understand basic insertion sort not even a single person actually talk about temp everyone was just saying that place in the correct order, and this man taught me in 1 minute

I think this is a good description of insertion sort: The full insertion sort algorithm works by dividing an array into two pieces, a sorted region on the left and an unsorted region on the right. Then, by repeatedly inserting elements from the unsorted half into the sorted half, the algorithm eventually produces a fully sorted array. The full steps of this process for an array, A, are shown below - Designate the leftmost element of *A* as the only element of the sorted side. This side is guaranteed to be sorted by default, since it now contains only one element. - Insert the first element of the unsorted side into the correct place in the sorted side, increasing the number of sorted elements by one. - Repeat step two until there are no unsorted elements left. Notice that this method doesn’t require us to create a new array to store the sorted values. All we have to do is keep track of how much of the original array is sorted. This makes insertion sort an in-place algorithm.

OMG, yes! My favorite programming channel transformed into an even better one! Love your content, it really really helped me a lot in my studies and with my projects as well! Keep up the good work, you are awesome! Quality content at it's finest! ;)

Congrats on the 100k !!!! I remember subscribing to you at 15k.

look at how much your channel grew, remembering when I came you were under 1k subs. Tho you definetlly deserve and earned them bro, you are literally the best programming tutoring channel I know of! Thank you for this amazing content bro!

Excelente explicación en el paso a paso, felicidades. Gracias por aportar a la nueva generación de desarrolladores.

bro is single handedly the reason I am clutching this class on my own, god bless your soul😅🙏🏾

I never write comments, but thank you for all your work! This is the best explanation for a visual learner like me. It really helped to have your visualisation alongside code to see what is going on step by step.

You are best my dear sir 🙌

Thank you for this! I think where I'm struggling is understanding why we need to place a value in "temp" before we do a comparison. But your graphics and explanation are TOP NOTCH. A real service to the CS community worldwide. Thanks again!

you are my god of programming thank you bro love from india, you are genius

Thanks for the explanation I have been taking classes at uni about this topic but my teacher hasn't been able to explained right. Thanks for the content. It was so helpful.

I love you bro！！！！！！ so clear explanation !!!! I failed to figure out insertion sort on my teacher's class even though I spent more than 2 hours, but I figure it out only take 7 minutes by watching your video !! amazing !!

This is the best explanation I found in RU-vid. Thanks!

These are truly some of the best visual explanations of the sorting algorithms I literally ever seen. Well done man. Very cool. 👍

Omg bro you are awesome. You're a natural teacher thank you for the awesome content you really help me with my programming subject. God I wish I had teachers like you.

Thank you so much for making this video and also the other tutorials for algorithms! Great help!

Thank you bro! It is a pleasure to see your tutorials! You are my source of inspiration and learning! Keep up!

Hey man, just wanted to say, keep up the good work, ur videos have been helping me a lot this sem for data structures, thank you 😎

Passing my GCSES with this one 🔥

Hey man, Im from Vietnam Just came accross your channel and really like it! Thank you very much👍💪

"How about a 9 and a 1 and an 8" really got me smiling and singing it for the rest of the video!! This man is a legend!!!!

Please never stop upload waiting for your complete course on data structures and algorithms

🔥this guy video >>>> my 49$ DSA course

doing the gods work fr fr

Hello can you please make videos on this topics. 1. Dynamic Programming 2. Backtracking

Hello bro, just wanted to say congratulations on reaching 100,000 subscribers 😁 (I am glad I stumbled across this channel when I did, your tutorial playlists are the best on youtube)

Brocode rockzz❤thanks to youtube's algorithm for suggesting this channel.

This is the best video so far on the Insertion sort :)

this dude is really saying hey guys it's Bro and at the end of the video I called him a real bro

Your explanations are the best , glad i found your channel 🎉

This was what I was waiting for.

The way I subscribed immediately is crazy

CONGRATS ON REACHING 100K SUBS!!!! YOU ARE THE BEST, BRO!!!

SOOOOOOOO Close to 100k RU-vid button on your way!

I love you this is amazing and so quick and simple

great tutorial! is there a reason we do j-- inside while loop and then use the [j+1] index instead of just removing the j-- and using the j index?

Hey bro 1 request please continue your series on dsa,your explaination is so good that even toughest question can be understood in 1 go.Please its a humble request

congratulations for being 100k youtuber

This was such nice explanation! Thank you!

Your Content and code is AWESOME brother Keep it up

Thanks man. This was awesome explanation.

It's difficult but I have to try ,thank you!!!

Thanks for the video man, really great explanation

it's generally so overwhelming to do dsa but istg you made it so easy and the concept crystal clear😌👍

This was really useful. Thanks!

Sir your all full courses are awesome I have a request if you could please make a course on Android app development

You are the best

Thanks a million. This video is a life saver!♥

best explanation easy.

Man you're a legend, no joke !

I hope that you will continue making this for all sorting algorithms there is.

Cool video..please do videos on remaining sorting algorithms too.. like O(nlogn) in worst case...

congrats for reaching 100k!!

thank you much sir it is help full

Nice Class

you are the flipping best

Great video

I knew this but not properly I guess. This video was very helpful. Btw I had to ask what is the RAM of your pc?

Chef kiss

leaving random comment causs you explained it better than my teacher

Thanks!

I commented to boost the algorithm!

What are the avantages of insertion sort

Thanks, man You're awesome!

Damn this was so easy

Yooo ur so close to 100k :000

Learnt in 7 minutes,THALA FOR A REASON

Congratulations on 100k🙌🙌

THANK YOU

great vid

Bro always carries me in coding

thx for this

I didnt understand it, watched the first minute and then coded it in 2 minutes in c++ to see if i actually got it. thanks man! void arr2(int arr[]){ for (int i = 1; i< 14; i++){ int temp = arr[i]; for (int j = i-1; j >= 0; j--){ if (arr[j] > temp){ arr[j+1] = arr[j]; arr[j] = temp; } } } }

Thanks 👍🏽

Love you, ❤

thank you

so good! thank you

Please cover, Heap sort

Yo bro, just wanna ask are you gonna drop C language videos anytime soon, wanna refresh my concepts of C that's all

Thank you for these epic educational videos. You explain it super clear 💯

O.o 100k:)

regarding the condition j >= 0 in while, when j becomes

صحا حمزة

this is a siwon moment !

Thank you sir it's a wonderful channel may I ask you if you can make Django course

At 3:27 how did sysout become system.out.println Pl tell

but if you will understand code + animation then it will be better for us

10k likes and all respect

imparator 👑👑

what did the last line array[j+1]=temp do?

👍

Gold

100k special = pls do a c course

you're op

100.000 SUBSCRIBERS!!!!!!!!!!!

have just destroyed that like button