Insertion Sort Algorithm Made Simple [Sorting Algorithms] 

I have completed all 3 parts, the course is great, i highly recommend it. A dynamic programming and system design would be a great addition to the existing 3 parts.

You're an inspiration Mosh! so much so that we decided to create a coding channel ourselves. Of course, we are nowhere near your way of teaching, but we see you as an inspiration and a guide for succeeding!

Now I can say one thing to CS students... ODIN is with us ❤️

Hi Mosh! Just wanted to say that I especially like how you gave us 20 minutes to attempt the implementation instead of us just directly copying your code. I followed your instructions and was able to implement it by myself! It really made my day (the little things in life)...thank you so much!! I truly enjoy learning from your videos...thanks again! :)

The explanation was very good, the call to action to try it ourselves for 20 minutes is refreshing and wonderful, and when you demonstrated how you actually write the code - it was very informative and clear. Excellent video, thank you!

Well explained, very similar to this book "Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein - Introduction to Algorithms - The MIT Press (2022)"

This made little sense until I realised I was thinking about it wrong. It wasn't until I sat down on my ipad and tried to draw each step that I realised that firstly you are setting the current to the 2nd item in the list and J to just A NUMBER that is 1 less than the index. Then I realised that j-- was setting j to -1 and not 0. And once you do j + 1 = current this is the same as array[0] = current. So I basically understood it like that: first steps: array[1] = array[0] j = -1; arr[0] = current (array[1]) I don't know if this makes sense to anyone else rn but if you are confused I suggest you just spend some time on it and draw it out at each step. I love Mosh though. He's the only one that actually encourages me to sit down and try something and this makes a huge difference. He breaks the developer's mindset of just watching tutorials forever and not actually practising it. In the last 2 days this is the second sort that he helped me truly understand and implement rather than think that I understand and then when I need to do it I don't actually get it. Awesome work!

This one is for all all my friends who love for loops. The Approach I took is of swap. Basically I think of it as a swap operation only and not as shift operation, as mentioned by Mosh. So swap until you find the correct spot for the current element in the sorted portion. Because of swapping the index of current gets changed, so keeping track of it, and decrementing it after every swap. private static void insertionSort(int[] arr) { for (int i = 1; i < arr.length; i++) { int curr = arr[i]; int currIndex = i; for (int j = i - 1; j >= 0; j--) { if (curr < arr[j]) swap(arr, j, currIndex--); // after swapping the index of curr changes so decrementing else break; // reduce iterations as elements before ith index are sorted } } } private static void swap(int[] arr, int j, int i) { int temp = arr[j]; arr[j] = arr[i]; arr[i] = temp; }

Mosh has gotta be a really rich guy, because man this guy knows so much

this is explained waaaaaaay better than it was to me in school today

Yesss! 👍👍 Why didn't I have this 2 years ago when I was struggling through data structures and algorithms? 😩

I just want to say you: Thanks alot although its my weekness, l would say l actually like you be my teacher . If l lived in your city l have found you to be my private teacher. Despite some web s that you recommend are not responsible in my country ,l keep trying to learn . At least l could say you are so generous ,so l wish a happy life for you.

The elements are not sorted right after they are moved I thought. Not until the very end are they sorted. That’s what my teacher said and it seems right. Now I’m confused

This guy is amazing

Great explanation, but can any please explain why we're decrementing the value of j in the while loop?

I need the intro music. It's so good

mosh thank you thank you thank you for these courses

What is the purpose of dicrementing the loop variable inside the while loop? Thank you and I hope you all are doing great

Mosh please i want your django course cuz your explanation is easy and simple at the same time which motivates more to code even more.PLEASE.PLEASE

Beautiful explanation! I’ve been taking 3 parts java course and I loved it . Do you think you will be able of doing java + hibernate + spring boot ( based on my sql Database ? ) I’m gonna take that course for sure ! Thanks in Advance

Hey mosh you are really a very good teacher. I love your videos. I had learned python by watching your videos. Thank you for all your videos. I have a small request, can you make videos on game development with python. It will be very helpful. Thank you!❤️❤️

thanks mosh for your very useful tutorial! I'm super exited to learn more from you!!

nice!! thankyou !! my head hurts thinking about my projects in my sub but thanks fot this it really help

hey Mosh thank u for that . but we still waiting for u r upcoming django course .

I have a question, in this algorithm, the second loop is a while loop why?

thank you animation is so clean

Have you released video about bubble sort?

I already took your Algorithms course in Java but implemented the algorithms in JavaScript! An amazing course! Really recommend it!

Hey mosh , can u pls also make a video on bubble sort and insertion sort using *python*

Sir we need an django tutorial on delete,insert,update,delete and search operation..our institute have given us a project to build a web application.. I already shared your 6 hr python tutorial anoung student and that was great..django tutorial will be helpful for everyone who used to develop web application Thank you

hey Mosh. Did you remove all of your courses from Skillshare? I was going through your mySql course but I can't finish it :(

Great tutorial!

Finally understood😊 Thank you soo much!

great as always

Hi Mosh, Thanks for the Great Video I hope you will add some training in your Java too like Unit Testing using JUnit and Mockito, Java Secure Programming (This course is very important and only few tutorials on Web some are very expensive to enroll), Spring Framework and a Full Stack Developer which can give knowledge and experience to have good Job in Java World. Have a happy and Long life to you Mosh!!!.

WELL EXPLAINED .. THANK YOU..

Love your videos.

This is called the art of teaching.

Are the rest of the videos based on Algorithms still available on mosh's channel

amazing explaination baldy!!!

Sir, I'm your student from Pakistan I love your videos so much sir the reason for my texting you is a request that can you please upload tutorial about web scraping with python i watch many videos on youtube but your method of teaching was too good i really loved it can you please do that for your students

Thank you !

Hi Mosh all your tutorials are good, so could you please make a Linux tutorial for beginner to advance?

Hey, mosh! Which language you are using in Data structure?

Thanks a ton for these videos. I dislike having an index that is inherently -1 like you've done with j as it is conceptually obtuse even if it makes the code slightly cleaner. I would prefer to just use a normal index for the while loop and then use (index-1) when you need to access the previous item. Also I think it can be confusing to use the letter j specifically for something like this as j is almost always used to represent an inner nested loop index which isn't really what we're doing here

what does o in the time coplexity calculation represent. if I had a list of 6 items and wanted to see the best and worst case times to sort these items how would I calculate how long this takes.

May I know which software you are using to create these tutorials?

After finish Redux course I going to start with Data structure course! Thanks you Mosh and keep going teaching us new things :)

thanks mosh

Which screen recorder do you use?

Simple is the best!

Hey! Nice video mate :)

Thank you

Thank you for your video! great Job! :)

Where do I find Selection Sort by Mosh?

awli bod moshveq jan movafaq bashi : )

Hi loved your python course

very helpful.

As always wonderful video sir plz make one video on Django

i am much beginner to understand such questions can some1 ttell Given the following array passed to insertion sort algorithm below: A[] = {33, 45, 50, 32, 17, 67}; // Array is beginning with zero index INSERTION-SORT(A) Set j=3 key = A[j] i = j - 1 while i >= 0 and A[i] > key A[i+1] = A[i] i = i - 1 [End While Loop] A[i+1] = key END What will be the new array A after the above code runs.

Loved this video! very simple to understand and follow along! Thank you so much Mosh

Hey mosh you teach all js course for algorithm you choose java Y? We need it in js

Mosh do you think your react course will be fine until 2021 or they will come new future to the react app

Any help on how to use mutex and channels on a sorting algorithm in go language

Site Google pay is not working at the checkout

Mosh can u pls make a video about Java frameworks and how to use them well

Beautiful.

Hi can you please make a vedio of how to use a macbook Pro, complete ( A-Z ) guide , this would help me a lot please

Wow good vidio

hi mosh thank you i have a question do you have a hdml course i would love to learn that after python

Thanx!

Why do we decrementing j?

Is this can run using mobile phone in the app of MOBILE C?

Big fan sir you are my idol

Dear sir make a lecture about python an data science. I really like your explanation method. Sir please

Won't it be O(n^2) for the worst case?

Wonderful

sir what if one or all of numbers are negative? then code may fail, so how do we tackle that?

How is shifting and inserting different from swap?

Please create a graphql course :)

What do you use for animation

How to do with generic data types?

Why decrement j?

Hey mosh Can I use it in JavaScript?

Quick question, why do we have to decrement j after shifting the greater value to the right? Can't we just use the same j index to store the current into the array without decrementing it?

Hey Mosh! I really do love your RU-vid videos and hope to explore some courses on your website , but I’m having difficulty in creating an account (the captcha appears to be half). Would be glad if this issue is resolved.

And a full course on algorithm and data structure.. It's way more simple to learn from Mosh

Wanna buy the react native course but its too expensive

Can someone help me understand why we are decrementing j?

Could someone please help me in understanding why arr[j+1] = current

is this eclipse?

why i can't use keyword "var"? and how make var not be error?

Please open a discord server for Python and other programming purpose. :)

absolutely

Hi mosh, this is rohit from India. I ve been following and practicing ur python tutorial very attentively. Im an economically backward student to purchase ur course in dollars or somewhere around to the higher prices when converted my rupees into ur currency & where I cant afford it. Can u pls help me through some easiest way to gain ur valuable certification of Python (Community) through online, so that I can add it in my resume and can appear for interviews which can give me a great potential to get selected. Sincerely, Hoping for the best assistance from u thank you.

Lov from india

What's the music?

how to do in oythin

Hey mosh... it will be really helpful if you provide R package classes also

Superrrr👍