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.
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!
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!
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 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; }
realize if you swap, you'll reduce the efficiency of the algorithm. In that case it wouldn't infact be an insertion sort because for insertion sort, you have to keep your key in a new variable and shift all the elements at once to create space for inserting. When you shift you simply overwrite on the current elements. Maybe we call your algorithm "Swap sort" but will be much slower especially for large arrays
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
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! :)
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.
Dicrementing the loop variable inside the while-loop simply terminates the loop. Since the while-loop only runs when two conditions are met ( 'j is greater than or equal to zero' and 'array[j] is greater than the current), if the loop variable j is dicremented, from having a value of 0 it will become -1 and the conditions for running the while-loop is not met, so the loop is terminated.
@@jeffreyestayobasanes Yeah thanks for replying bro. The purpose of dicrementing the j variable is not explain well in this video. I tried to watch other vids about insertion sort and it seems the purpose of dicrementing ng j variable is for comparing the current variable to the elements upto the leftmost variable via index (where array[0] == the first element in the array) The condition inside the while loop which is j >= 0 will terminate the loop.
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!❤️❤️
I will buy Django course from you Mosh, please create many advance topic too in Django like REST API and real world projects. Connecting Django to MySQL or PostgreSQL too.
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
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!!!.
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
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
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.
and this 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 next index of key?
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.
Hey Mosh! I really do love your CZcams 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.
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.
You're moving from right to left, in the case of the 'sorted' list, so you start with the number on the far right, shift right if its larger, then move to the number directly on the left (j--), do the same comparison.
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?
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.
It seems to me, he made the simple insertion sort difficult to understand.
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!
Now I can say one thing to CS students... ODIN is with us ❤️
😀😀
my oten is always with me 🙏
😂😂
😀😀
😅😅
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!
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)"
Mosh has gotta be a really rich guy, because man this guy knows so much
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;
}
realize if you swap, you'll reduce the efficiency of the algorithm. In that case it wouldn't infact be an insertion sort because for insertion sort, you have to keep your key in a new variable and shift all the elements at once to create space for inserting. When you shift you simply overwrite on the current elements. Maybe we call your algorithm "Swap sort" but will be much slower especially for large arrays
@@DonARTello250 Yeah was just about to say that
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
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! :)
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.
Yesss! 👍👍 Why didn't I have this 2 years ago when I was struggling through data structures and algorithms? 😩
Great explanation, but can any please explain why we're decrementing the value of j in the while loop?
this is explained waaaaaaay better than it was to me in school today
This guy is amazing
What is the purpose of dicrementing the loop variable inside the while loop? Thank you and I hope you all are doing great
Dicrementing the loop variable inside the while-loop simply terminates the loop. Since the while-loop only runs when two conditions are met ( 'j is greater than or equal to zero' and 'array[j] is greater than the current), if the loop variable j is dicremented, from having a value of 0 it will become -1 and the conditions for running the while-loop is not met, so the loop is terminated.
@@jeffreyestayobasanes Yeah thanks for replying bro. The purpose of dicrementing the j variable is not explain well in this video. I tried to watch other vids about insertion sort and it seems the purpose of dicrementing ng j variable is for comparing the current variable to the elements upto the leftmost variable via index (where array[0] == the first element in the array)
The condition inside the while loop which is j >= 0 will terminate the loop.
@@jaygarzon6709 thanks bro, I too was looking for the same explanation
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!❤️❤️
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
I will buy Django course from you Mosh, please create many advance topic too in Django like REST API and real world projects. Connecting Django to MySQL or PostgreSQL too.
mosh thank you thank you thank you for these courses
I need the intro music. It's so good
CZcams premiere countdown?
me too
@@MandolinSashaank That it? Where do I get it>
thanks mosh for your very useful tutorial! I'm super exited to learn more from you!!
@@programmingwithmosh always at your services mosh!
I already took your Algorithms course in Java but implemented the algorithms in JavaScript! An amazing course! Really recommend it!
I have a question, in this algorithm, the second loop is a while loop why?
nice!! thankyou !! my head hurts thinking about my projects in my sub but thanks fot this it really help
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
@@programmingwithmosh i need spring boot tutorials why u ignoring my request
Hey mosh , can u pls also make a video on bubble sort and insertion sort using *python*
In python no algorithm steps are required just use the sort function directly
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!!!.
hey Mosh thank u for that . but we still waiting for u r upcoming django course .
@Ahmad Ebrahim It will be best if he put django + react but it will be enough if he put only django course also.
Umar is he made django course?
@@hamzaanis2321 Mosh told me that he is going to create Django course.
@@KodiLearn Oh ok man
Hi Mosh
all your tutorials are good, so could you please make a Linux tutorial for beginner to advance?
thank you
animation is so clean
hey Mosh. Did you remove all of your courses from Skillshare? I was going through your mySql course but I can't finish it :(
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
Hey, mosh! Which language you are using in Data structure?
Finally understood😊
Thank you soo much!
After finish Redux course I going to start with Data structure course! Thanks you Mosh and keep going teaching us new things :)
Have you released video about bubble sort?
WELL EXPLAINED .. THANK YOU..
May I know which software you are using to create these tutorials?
He's using the IDE called Intellij
Are the rest of the videos based on Algorithms still available on mosh's channel
Great tutorial!
Which screen recorder do you use?
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
amazing explaination baldy!!!
Loved this video! very simple to understand and follow along! Thank you so much Mosh
This is called the art of teaching.
great as always
thanks mosh
Where do I find Selection Sort by Mosh?
Thank you !
Love your videos.
Thank you for your video! great Job! :)
Mosh do you think your react course will be fine until 2021 or they will come new future to the react app
Thank you
As always wonderful video sir plz make one video on Django
Site Google pay is not working at the checkout
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.
and this
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 next index of key?
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.
Hey mosh you teach all js course for algorithm you choose java Y? We need it in js
Hey! Nice video mate :)
Hi loved your python course
Simple is the best!
hi mosh thank you i have a question do you have a hdml course i would love to learn that after python
yes
very helpful.
awli bod moshveq jan movafaq bashi : )
Mosh can u pls make a video about Java frameworks and how to use them well
Dear sir make a lecture about python an data science.
I really like your explanation method.
Sir please
What do you use for animation
Why do we decrementing j?
Beautiful.
Won't it be O(n^2) for the worst case?
I agree
How is shifting and inserting different from swap?
Is this can run using mobile phone in the app of MOBILE C?
sir what if one or all of numbers are negative? then code may fail, so how do we tackle that?
Hey mosh Can I use it in JavaScript?
Any help on how to use mutex and channels on a sorting algorithm in go language
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
Thanx!
Big fan sir you are my idol
absolutely
Wow good vidio
Please create a graphql course :)
Wonderful
Hey Mosh! I really do love your CZcams 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.
How to do with generic data types?
is this eclipse?
Wanna buy the react native course but its too expensive
Please open a discord server for Python and other programming purpose. :)
why i can't use keyword "var"? and how make var not be error?
And a full course on algorithm and data structure.. It's way more simple to learn from Mosh
@@programmingwithmosh yeah sure,I do ☺
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.
Can someone help me understand why we are decrementing j?
What's the music?
inshah allah boys played well
I dont get it, why do we decrement j after?
You're moving from right to left, in the case of the 'sorted' list, so you start with the number on the far right, shift right if its larger, then move to the number directly on the left (j--), do the same comparison.
Superrrr👍
I just wanna thank you for python tutorial you are a great teacher Also please put a course on data structures
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?
Could someone please help me in understanding why arr[j+1] = current
Hey Mosh, I think I like you more than I like any youtuber. I am your big fan.Tell me if i can do anything for you. It would be my pleasure ❤️❤️🤗