Your explanations themselves are so good that I code the algorithms myself. Before following this playlist I used to think that these algorithms have to be learned and now I laugh at myself
Every time kunal is saying don't worry about complextity,One thing I want to say to Kunal In binary Search You have covered more time complexity than other youtuber's whole complexity lecture. Even you are saying I will make a Complexity video on this. That's why You are gem to us.😉😉
whenever the time complexity concept comes, kunal everytime saying "i have covered it in previous lectures, why i am saying it again and again!" makes me repeat it with him
One observation - for every pass we are sorting pass + 1 elements of array i.e. when pass = 0(i = 0), 2 elements are sorted. This sort happens using swapping technique which can be visualised as ''Bubble sort in reverse' - basically here we are swapping in reverse order - like compare adjacent element and swap and repeat :) So the min element of array comes at first index position of array as a part of this swap.
I was taught insertion sort in my high school. Never understood and always made some mistake due to logic error. After this lecture I feel satisfied fr. Thank you Kunal.
after watching 8-9 different videos of insertion sort from every source but won't be able to understand the internal working of insertion sort. But finally, when I saw your detailed explanation of the insertion sort video, it cleared my all doubts. Thanks, Kunal Kuswahaaa...
from zero interest in coding to solving questions from my end ... you always help me thank you so much ... and god bless you with more happiness and success.
this insertion sort i found a bit tough than other sorting algorithms but you made it easy to understand for me. thankyou once again for providing this amazing dsa playlist. 😊
Hey Kunal! Loving your way of explanation and the way you make difficult concepts easier and simpler is beyond expectation. I learnt a lot from your videos, I learnt indentation, writing clean code, logic building and what not. Please complete this playlist as soon as possible. It will be beneficial for everyone who started this series hearing your words that this is the only course you need to get a job at FAANGM.
dont believe him guys...anyone watching this video just go once through the comment section you will not need more proof that this is the best course on the internet and he has the best teaching skills.... i am an idiot, i hated dsa but the way he teaches it makes me motivated to keep on doing and know what, i am improving my problem solving.... he not only teaches dsa but also the most important skill which is problem solving and how to approach a problem. just believe in this course and keep on solving and supporting this channel.
hey, very detailed video Kunal. Got every bit of it. Thank you to put your time and efforts into this. Nobody explains dsa in this much of depth. Thank you😊
Usually I don't comment but you made me to like and comment in your videos. You owe me man. Also enjoying your DevOps stuff parallelly. Ahh one thing I want to let you know, I gave my computer networking exam by just watching your networking video twice, nothing else and I nailed it 😉. Hope to meet you one day ❤️
Kunal Sir Thanks for this video as well as for code and notes from GitHub It helped me very well You explain very well that anyone can understand from age 2 to age 90. There can also understand who don't know to read and write and only Know English Thanks for providing this ☺️☺️
The hardest problem I faced in your lecture was 2D matrix array. I always return back to that video to grasp the details, otherwise everything is CRYSTAL clear!
Hey @KunalKushwaha I think this is not the Insertion sort. What we are doing here in the video is a reverse bubble sort. ----------------------> Please correct me, if I am Wrong. Reverse bubble sort means ---------> we are popping the smallest element to its correct Position. BTW: Code for Insertion sort...…. From ChatGPT ....................................................................................................... public static void insertionSort(int[] arr) { int n = arr.length; for (int i = 1; i < n; ++i) { int key = arr[i]; int j = i - 1;
/* Move elements of arr[0..i-1], that are greater than key, to one position ahead of their current position */ while (j >= 0 && arr[j] > key) { arr[j + 1] = arr[j]; j = j - 1; } arr[j + 1] = key; } } ......................................................................................................... I guess you will replace this Video ASAP. If you feel i am correct.
Hey Kunal I commented on the last video also ,, it's good that you are uploading in a regular basis ❤️ my question is will there be any long video like the one of binary search where u explained every possible topic questions... Will there be that kind of video for sorting? Just wanted to ask thanks ❤️
there is one more implementation of Insertion sort in which the overhead of swap function is avoided.: public static int[] optimizedInsertionSort(int[] nums){ if(nums.length == 0) return new int[0]; else{ for (int i = 1; i< nums.length; i++){ int key = nums[i]; int j = i- 1; while(j>=0 && nums[j] > key){ nums[j+1] = nums[j]; j--; } nums[j+1] = key; } return nums; } }
Hey Kunal, just want to appreciate your efforts. I love your videos and these videos are actually making my concepts more strong. There was a quick question of mine that is it essential to buy any book for Java or your video lectures and notes are sufficient for placement purpose and other open source contribution purposes...????🙄
i dont know why i was facing problems in binary search but after that all the sorting algorithms are fine . i think binary search should be learned after sorting .
DSA + interview preparation playlist: th-cam.com/play/PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ.html
I wish teachers from my college watch these videos and learn how to teach dsa! 😶
Im not attending my college classes😂after this course. It's a surprise you still attend classes
After watching this course I ask cross questions to faculty , it's really fun😂
@@SKILLCRYSTAL same😂
@@vedanthbaliga7686 the point was, you'd attend if a teacher like Kunal was teaching 😂
@@vedanthbaliga7686 same 😅
Teaching in the simplest way possible yet most effective way of teaching.I'll prefer to binge watch your videos rather than prime/Netflix....
So nice of you!
first time in my life I was able to solve 3 leetcode medium questions in one attempt. Thank you bro.
All the best
When kunal teaches, the concepts are crystal clear ❤️
Thank You!
His teaching materials should be distributed to all the online professors.
HA HA HA HA HA
Your explanations themselves are so good that I code the algorithms myself. Before following this playlist I used to think that these algorithms have to be learned and now I laugh at myself
Every time kunal is saying don't worry about complextity,One thing I want to say to Kunal In binary Search You have covered more time complexity than other youtuber's whole complexity lecture. Even you are saying I will make a Complexity video on this. That's why You are gem to us.😉😉
yes, you are right.....i am placed in paytm just by watching his entire DSA playlist
whenever the time complexity concept comes, kunal everytime saying "i have covered it in previous lectures, why i am saying it again and again!" makes me repeat it with him
Bhaiya can't wait to watch your next playlists on web development , machine learning , and many more
Had become big fan of yours 😍😍
Glad to hear that
@@KunalKushwaha please pls pls do a playlist for mern stack - webd
One observation - for every pass we are sorting pass + 1 elements of array i.e. when pass = 0(i = 0), 2 elements are sorted.
This sort happens using swapping technique which can be visualised as ''Bubble sort in reverse' - basically here we are swapping in reverse order - like compare adjacent element and swap and repeat :)
So the min element of array comes at first index position of array as a part of this swap.
Your tutorials are helping many tech people it's like a gem , please do not stop complete the whole algorithm concepts
I was taught insertion sort in my high school. Never understood and always made some mistake due to logic error. After this lecture I feel satisfied fr. Thank you Kunal.
You are the best teacher in the entire world to learn about the Data Structure and the algorithm
your god for me brother no one teaches like you....teachers from our college never teach us like your teaching...Thank you
after watching 8-9 different videos of insertion sort from every source but won't be able to understand the internal working of insertion sort. But finally, when I saw your detailed explanation of the insertion sort video, it cleared my all doubts. Thanks, Kunal Kuswahaaa...
If concepts were taught this clearly in college, Data Structures wouldn’t seem difficult to anyone. Amazing work, Kunal-you’re fantastic!
The best thing about the lecture is amount of time given to explain the algorithm to the time given to coding
from zero interest in coding to solving questions from my end ... you always help me thank you so much ... and god bless you with more happiness and success.
this insertion sort i found a bit tough than other sorting algorithms but you made it easy to understand for me.
thankyou once again for providing this amazing dsa playlist. 😊
Hey Kunal! Loving your way of explanation and the way you make difficult concepts easier and simpler is beyond expectation. I learnt a lot from your videos, I learnt indentation, writing clean code, logic building and what not. Please complete this playlist as soon as possible. It will be beneficial for everyone who started this series hearing your words that this is the only course you need to get a job at FAANGM.
Everything seems so easy when u teach some people are deliberately making taboo of it is so difficult I am thankful to you for this quality content 👍
Happy Teacher's Day, Kunal!!!
Thanks for teaching us!!
I just understood that what I have to do and then I made the code logic by myself.
Thank you so much Kunal bhaiya.
Literally binge watching your content 🙌🙌
Hope you enjoy!
@@KunalKushwaha LOVE THEM SO MUCH THANK YOU!!!GOD BLESS YOU YOU PURE SOUL
I Don't Know How To Thank You But I Am Sharing It Through All My Social Media Platforms
Thats more than enough for me
dont believe him guys...anyone watching this video just go once through the comment section you will not need more proof that this is the best course on the internet and he has the best teaching skills.... i am an idiot, i hated dsa but the way he teaches it makes me motivated to keep on doing and know what, i am improving my problem solving.... he not only teaches dsa but also the most important skill which is problem solving and how to approach a problem. just believe in this course and keep on solving and supporting this channel.
Thanks for sharing!
25 mins explanation 5 mins of code
loved it
I used to watch and learn daily from this course but haven't done anything past 15 days. Hope I continue to learn from today. 🙂
no u wont
entire insertion sort explained clearly in detail and with good explanation...
hey, very detailed video Kunal. Got every bit of it. Thank you to put your time and efforts into this. Nobody explains dsa in this much of depth. Thank you😊
Doing a great job! Always needed a good playlist I could depend for DSA placement prep!
3 videos in under 24 hours🤯thanks Kunal. Idk how you do this😬
Are you KONKANI?
Best Explanation video for Insertion Short I found on TH-cam 🤩
Usually I don't comment but you made me to like and comment in your videos. You owe me man. Also enjoying your DevOps stuff parallelly. Ahh one thing I want to let you know, I gave my computer networking exam by just watching your networking video twice, nothing else and I nailed it 😉. Hope to meet you one day ❤️
Your explanations are so detailed that I'm usually able to write programs without even seeing your code.
Kunal Sir
Thanks for this video as well as for code and notes from GitHub
It helped me very well
You explain very well that anyone can understand from age 2 to age 90. There can also understand who don't know to read and write and only Know English
Thanks for providing this
☺️☺️
Kudos to you for uploading soon ! ❤️❤️
this course deserves millions of likes
you taught the concept so well that now my Genetics also know Insertion sort. Hence my grand children will also be good in sorting now.
Watched this video during viva and explained this algo well to my teacher.
Thanks kunal bhai
The way to explain complexity is awesome.
Thanks for teaching us like no one did till now!! One small request, please make lectures on dynamic programming as well!!
The hardest problem I faced in your lecture was 2D matrix array. I always return back to that video to grasp the details, otherwise everything is CRYSTAL clear!
Bhaiya just one word for uh, thankyou guru ji , wishing you a beautiful life ahead I'll meet you one day ❤️
Hope Kunal brings out more quality content like these. Loved this
His explanation was so good that i was able to write the code myself before checking his ❤❤❤
I compare this against 3-4 folks and by far KK's desc is awesome
Another great video Kunal. You are the man. Thanks for your charitable endeavours.
Kunal u r great person I wish every teacher watch this vdo and tech him students this way🎉
Awesome content.. Not every educator can ease concepts out as simple as you do. Keep educating ...
It is amazing to learn every step so wonderfully explained by you
best explanation bro explained everything that it take only five minutes to code myself
Sir you are awesome your explanation is great and one thing i write sir in my every comment because you are like my mentor a real teacher 🤗🤗🤗🤗🤗🤗🤗🤗🤗🤗
won't come easier than this! great explanation
Thank a bunch kunal literally my doubts are not Doubt yet😅
Great Explanation
thank u for ur amazing efforts ,it really helped me to understand dsa topics
Thanks @Kunal Kushwaha for creating me a better CS student
Amazing video @kunal. (Concepts == cleared) -> true
awesome video
Superb explanation. Absolutely amazing.
Great teacher.
Thanks kunal that explanation was epic, I was struggling in understanding this concept.
Superb explanation🎉🎉🎉🎉🎉
Kunal bhai Is rocking 😎
Best playlist ever
As a beginner,I felt this is better than CLRS pseudocode.
I love the way you teaching 😍😍🥰🥰
You explained this so clearly, thank you!
after you explain i just code it myself thanks sir
Ur amazing just completed watching selection sort
Hey @KunalKushwaha I think this is not the Insertion sort. What we are doing here in the video is a reverse bubble sort. ----------------------> Please correct me, if I am Wrong.
Reverse bubble sort means ---------> we are popping the smallest element to its correct Position.
BTW: Code for Insertion sort...…. From ChatGPT
.......................................................................................................
public static void insertionSort(int[] arr) {
int n = arr.length;
for (int i = 1; i < n; ++i) {
int key = arr[i];
int j = i - 1;
/* Move elements of arr[0..i-1], that are
greater than key, to one position ahead
of their current position */
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}
.........................................................................................................
I guess you will replace this Video ASAP. If you feel i am correct.
gurujii!!!!!!!!!!!!!!!!! u are great
Such a great way of explanation Thanks a lot bhaiya😊❣️
@aryangaming8665
why j>0 in this code plz explain
@@aaryanraj8342 becoz j is starting from i+1 and j-- everytime so if j will come to 0 then j-- result in Array outofbound condition
Great Kunal sir I loved your explanation man
Super explanation ❤😊
Thankss kunall
Boy's on fireee 🔥🔥🔥
Hey Kunal I commented on the last video also ,, it's good that you are uploading in a regular basis ❤️ my question is will there be any long video like the one of binary search where u explained every possible topic questions... Will there be that kind of video for sorting? Just wanted to ask thanks ❤️
Yes there will be many over the course, because sorting is combination of many concepts
24:49 what did he say 😂
Just for fun , great lecture kunal learned a lot from it.
My Man(kunal) stand by what he says 😮💨😍
there is one more implementation of Insertion sort in which the overhead of swap function is avoided.:
public static int[] optimizedInsertionSort(int[] nums){
if(nums.length == 0) return new int[0];
else{
for (int i = 1; i< nums.length; i++){
int key = nums[i];
int j = i- 1;
while(j>=0 && nums[j] > key){
nums[j+1] = nums[j];
j--;
}
nums[j+1] = key;
}
return nums;
}
}
Kunal on 🔥.... thank-you ji
Clearly explained. Thank you.
Glad it was helpful!
I liked this video very much.
Now, Kunal is in Form 😎
amazing as always ❤❤
ThankYou Kunal G!😇
Thank you the concepts are very clear now
you said "make sure you comment" thats why i commented otherwise i am in rush to watch next video of this series!
Le Kunal: Explains previously taught topic again ;whenever used
After Expalining,
Kunal: Why am i telling this agian and again
Your explanation is very good ! 😊😊. Can anyone suggest some project using these sorting algorithms?
bro superbbbbb loving yrr this palylist
insertion sort crystal clear
finally i understood the insertion sort.
Hey Kunal, just want to appreciate your efforts. I love your videos and these videos are actually making my concepts more strong. There was a quick question of mine that is it essential to buy any book for Java or your video lectures and notes are sufficient for placement purpose and other open source contribution purposes...????🙄
i dont know why i was facing problems in binary search but after that all the sorting algorithms are fine . i think binary search should be learned after sorting .
perfect explanation! thank you very much
Thanks you brother ❤