Book a FREE career counseling session with Learnbay: bit.ly/3km2s6W Let's march ahead, and create an unmatchable DSA course! ❤ Can someone please add timestamps, I will add them post-it.
Kaha thay aap,maine itna YT me search kia but aapka channel suggest nahi huwa until mera ek dost ne nahi bola hota Maira DSA teacher ne jo topic clear nahi karwa pa a aap wo kar di a Thank you
A lot of problems are going on in my life right now. But still I'm showing up everyday to learn something new in dsa and to solve questions. Problems will come and problems will go but I should continue my hustle. All of our struggles will pay off one day.
@@pulkit-rastogi97 don't lose your hope , just keep giving your best so that you won't regret, in fact if you honestly give your best you can , you are likely to succeed !
Same man, i was struggling to get up from bed the entire day. But finally at 11pm i decided i will atlest spend the last hout of my day working towards my financial independece
I first watched this video and i understood this partially, its fascinating how a few lines of code can be so confusing. Maybe thats why dsa is still considered to be very hard. I finally understood this concept after writing the code in paper and analyzing each iteration and what happens after the same. If anyone dont understand the topic, just do the same and you will understand it.
#Free Education For All...... # Bhishma Pitamah of DSA...You could have earned in lacs by putting it as paid couses on udamey or any other elaerning portals, but you decided to make it free...it requires a greate sacrifice and a feeling of giving back to community, there might be very few peope in world who does this...."विद्या का दान ही सर्वोत्तम दान होता है" Hats Off to you man, Salute from 10+ yrs exp guy from BLR, India.........
Stirver-Forever, Just striving to become the best version of myself. All thanks to raj vikrmaditya bhaiya. You're the best hope for students like us, belonged from tier-3 college, where there is no hope in hell to get a sde job, but their is this man standing with a freakin Sun the light the path for use. I don't know how I will thank you but one day I believe all my hard work will pay off when I will meet you and telling you my story of life, how I made zero to Prodigy. Till I didn't hit it, byy sir I am going back to hustle....
Hi Striver, At the Section of Selection Sort. I believe there might be a bit misunderstanding on calculating the Time complexity part: If we are given n elements, then in the first pass, it will do n-1 comparisons; in the second pass, it will do n-2; in the third pass, it will do n-3 and so on. Thus, the total number of comparisons can be found by; - (n-1) + (n-2) + (n-3) + ..... + 1 So i believe it should be : n(n -1)/ 2 At the end the TC is O(n^2), but i thought this should be the approach.
Yes striver 😭 plzzz Want to learn the whole series just from u. Already watched DP and Graph and Trees playlist from ur channel. Plzz striver try to complete this series as soon as possible 😭
This is going to be one of the best series of all time, thankyou so much raj bhaiya, just a small request can you please upload new videos asap, btw thankyou again ❤
Hi Striver @takeUforward , in the insertion sort ,the outer loop i.e. the loop with i should start with i=1 instead of i=0 because the j takes the value of i and in the while loop it says j should be greater than 0 so it will always stand false for the first iteration ( j=i=0) and moreover we don't need to check the correct order of single element . Please correct me if i am wrong because i am just saying what I understood .
Yeah you are right I believe. When I saw the outer loop, I was thinking the same thing and when I run the code, it prints the same output as with i=0, just as I thought it would be during the dry run.
Finally I found the best DSA course on UA-cam. ❤The way you explain concept is awesome. ❤❤ There was not a single second when I felt bored . Thankyou very much for your effort. ❤❤ ❤❤
Thankyou Striver. It's really an easy to understand. I also learnt to find Time Complaxity from every code by myself after seeing this video. Please make video on other sorting methods. ❤
thank you sir for good explanation and provide best dsa sheet and in this video i first time hear --- left chota -- , ( left small ) ---> at 38 : 40 😁😁 and again thank you sir ❤
one suggession for insertion sort why we run outerloop from i = 0 we should start directly from i = 1 till iarr[j]) { int temp = arr[j]; arr[j]=arr[j-1]; arr[j-1]=temp; j--;
it wouldn't impact anything if the outer loop is running from 0 to n-1 then when i = j = 0 it will no go into the while loop and move on to next iteration of i
Yes that how we can also make best case complexity to O(1) by Initializing cnt =0 in outer loop and in while loop we do cnt++ and if while loop never run (best case ) then cnt remain at zero then in outer loop give a condition if (cnt==0) break;
@@ramrawat681 no buddy we can't that's an error in video i think because while loop is running for every single element and if the element is in correct position means there's no greater element before it cnt will be zero and if you break the loop no elements after that will be checked so it will not give right answer i wonder if you implemented it successfully
Striver, Your content is truly outstanding and incredibly informative! Always thank you for your relentless hard work and consistently delivering the best content.❤
27:35 while computing time complexity for worst case, we do n-1 swaps in 1st iteration then n-2 swaps in 2nd iteration then n-3 swaps in 3rd iteration ...... 1 swap in (n-1)th iteration so its 1+2+3+......+(n-2)+(n-1) now if we apply sum of n natural numbers we have to substitute n=n-1 so the formula becomes n(n-1)/2 and not n(n+1)/2 as u given. Thanks.
Back in 2019, in my 3rd semester, I had "DSA" as a subject, in my entire college life that's the only paper I got arrear. It made me feel like the "Computer Science Dept" is not for me. After a few years, my job demanded me learn DSA, and my friend suggested your website. You are breaking my inferiority complex in DSA. Thanks Champ!
Today's lesson is that in insertion sort if I have used for loop internal loop instead of while loop then I couldn't have got the best time complexity in case of already sorted array
Book a FREE career counseling session with Learnbay: bit.ly/3km2s6W
Let's march ahead, and create an unmatchable DSA course! ❤
Can someone please add timestamps, I will add them post-it.
Hey @striver @take U forward
, it's a humble request can u, please complete this series soon as the placement season is coming soon....🙏
Hey Striver please complete the series.
@takeUforward Hey!
Can you complete Binary search Section more quickly
Bhaiya , if we solve a question and if need to sort the array then which algo we would to implement
Kaha thay aap,maine itna YT me search kia but aapka channel suggest nahi huwa until mera ek dost ne nahi bola hota
Maira DSA teacher ne jo topic clear nahi karwa pa a aap wo kar di a
Thank you
A lot of problems are going on in my life right now. But still I'm showing up everyday to learn something new in dsa and to solve questions.
Problems will come and problems will go but I should continue my hustle.
All of our struggles will pay off one day.
Hope is the most precious thing do not lost it
Beautiful message that I saw today!
This motivate me, I am going through some similar situation
@@pulkit-rastogi97
don't lose your hope , just keep giving your best so that you won't regret, in fact if you honestly give your best you can , you are likely to succeed !
Same man, i was struggling to get up from bed the entire day. But finally at 11pm i decided i will atlest spend the last hout of my day working towards my financial independece
I first watched this video and i understood this partially, its fascinating how a few lines of code can be so confusing. Maybe thats why dsa is still considered to be very hard. I finally understood this concept after writing the code in paper and analyzing each iteration and what happens after the same. If anyone dont understand the topic, just do the same and you will understand it.
Selection Sort TC -> worst - O(N^2) best - O(N^2)
2:45 - Selection Sort
6:50 - pseudo code / implementation for selection sort
14:28 - C++ code for selection sort
Bubble Sort TC -> worst - O(N^2) best - O(N)
17:41 - Bubble Sort
22:00 - pseudo code / implementation for bubble sort
25:52 - C++ code for bubble sort
Insertion Sort TC -> worst - O(N^2) best - O(N)
31:40 - Insertion Sort
36:55 - pseudo code / implementation for insertion sort
38:52 - C++ code for insertion sort
Thinking about your notes📝 😮😮
So many videos on Sorting on the internet yet this proves to be the BEST. Thank you so much.
The amount of effort you put in these videos is truly amazing. Thanks a lot 🙏
#Free Education For All...... # Bhishma Pitamah of DSA...You could have earned in lacs by putting it as paid couses on udamey or any other elaerning portals, but you decided to make it free...it requires a greate sacrifice and a feeling of giving back to community, there might be very few peope in world who does this...."विद्या का दान ही सर्वोत्तम दान होता है" Hats Off to you man, Salute from 10+ yrs exp guy from BLR, India.........
The amount of effort you put in these videos is truly amazing. 🙏
Stirver-Forever, Just striving to become the best version of myself. All thanks to raj vikrmaditya bhaiya. You're the best hope for students like us, belonged from tier-3 college, where there is no hope in hell to get a sde job, but their is this man standing with a freakin Sun the light the path for use. I don't know how I will thank you but one day I believe all my hard work will pay off when I will meet you and telling you my story of life, how I made zero to Prodigy. Till I didn't hit it, byy sir I am going back to hustle....
Striver, you are a gift to us all! thanks so much!
You make many people's life easier by teaching and making everyone understand so easily
2:45 Selection Sort
17:41 Bubble Sort
31:40 Insertion Sort
😊
Thank you
What an AMAZING teacher!!!
please complete this series soon because only 3,4 months are left for placement season its a humble request
BEST DSA TEACHER I HAVE EVER SEEN YOU ARE JUST AMAZING !!!
HI Striver,
One request please provide the videos for upcoming topics asap and Big thank for providing such an amazing series.
The amount of effort you put in these videos is truly amazing. Thanks a lot .
Hi Striver,
At the Section of Selection Sort.
I believe there might be a bit misunderstanding on calculating the Time complexity part:
If we are given n elements, then in the first pass, it will do n-1 comparisons; in the second pass, it will do n-2; in the third pass, it will do n-3 and so on. Thus, the total number of comparisons can be found by;
- (n-1) + (n-2) + (n-3) + ..... + 1
So i believe it should be : n(n -1)/ 2
At the end the TC is O(n^2), but i thought this should be the approach.
man you really dont know any maths , just open the bracket n2-n by 2 remove the constans and less imp terms and it boils down to n2 . ....
Understood! Thanks Striver for all this knowledge you are providing for free!
Hey striver , it's a humble request can u, please complete this series soon as the placement season is coming soon....🙏
Yes striver 😭 plzzz Want to learn the whole series just from u. Already watched DP and Graph and Trees playlist from ur channel. Plzz striver try to complete this series as soon as possible 😭
Yes please 🥺🥺🥺
brother once striver reaches to Poland he will be regular in posting videos !!
@@bishalkundu7592 u completed DP graph trees and you are waiting for basic topics?
@@yikes3807 Not basic but ya heaps Sliding windows stacks Queues Binary Search. Waiting for this
You are so smart and thank you so much, i learned in depth regarding the sorting algorithm from your lesson .
This is going to be one of the best series of all time, thankyou so much raj bhaiya, just a small request can you please upload new videos asap, btw thankyou again ❤
Thankyou for your efforts! Dsa scares me, but you are making it easy for me
Hi Striver @takeUforward , in the insertion sort ,the outer loop i.e. the loop with i should start with i=1 instead of i=0 because the j takes the value of i and in the while loop it says j should be greater than 0 so it will always stand false for the first iteration ( j=i=0) and moreover we don't need to check the correct order of single element . Please correct me if i am wrong because i am just saying what I understood .
Yeah you are right I believe. When I saw the outer loop, I was thinking the same thing and when I run the code, it prints the same output as with i=0, just as I thought it would be during the dry run.
It's easiest explanation I have seen. Appreciate the effort that went.
😅😅As usual awesome!!
Finally I found the best DSA course on UA-cam. ❤The way you explain concept is awesome. ❤❤
There was not a single second when I felt bored . Thankyou very much for your effort. ❤❤
❤❤
Thankyou Striver. It's really an easy to understand. I also learnt to find Time Complaxity from every code by myself after seeing this video. Please make video on other sorting methods. ❤
I find this is best DSA video i have ever seen on youtube. Thabak you Mr. TUF for this informative session.
For bubble sort striver you are using i>=1 in outer loop in the pseudo code but while using the code editor you are using i>=0.
Same doubt??
there is no need of going till i>=0 . but if you go , this is also right .....i=0 is automatically got minimum number when we are sorting
thank you sir for good explanation and provide best dsa sheet and in this video i first time hear --- left chota -- , ( left small ) ---> at 38 : 40 😁😁 and again thank you sir ❤
Understood! Amazing explanation as always, thank you very much for your continuous effort for making the video!!
bro in insertion ,why does i has starting value of 0 ,shouldnt it be 1 as single element would be sorted anyways
mannnnn!!!! Just addicted to ur teaching🔥🔥, every little concept is crystal clear
one suggession for insertion sort
why we run outerloop from i = 0 we should start directly from i = 1 till iarr[j])
{
int temp = arr[j];
arr[j]=arr[j-1];
arr[j-1]=temp;
j--;
}
it wouldn't impact anything if the outer loop is running from 0 to n-1 then when i = j = 0 it will no go into the while loop and move on to next iteration of i
I want to understand how does is not give index out of bound error by accessing -1, or it does short curcuit
@@dhruvverma1001 j>0, it will start forom j=1. for j=1 , the comparison will be between arr[0] and arr[1]
Appreciate the efforts! Very clear explanation!
PERFECTLY UNDERSTOOD! ❤
on point, easy to understand, depth in approach. overall great . thanks striver for your efforts
Otimization:
39:14 Guys run outer loop from int i=1 because there is no way to check first element with left .
Yes that how we can also make best case complexity to O(1) by Initializing cnt =0 in outer loop and in while loop we do cnt++ and if while loop never run (best case ) then cnt remain at zero then in outer loop give a condition if (cnt==0) break;
@@ramrawat681 no buddy we can't that's an error in video i think because while loop is running for every single element and if the element is in correct position means there's no greater element before it cnt will be zero and if you break the loop no elements after that will be checked so it will not give right answer i wonder if you implemented it successfully
Such a detailed and perfect explanation. Thanks a lot Striver!! Understood the concept really well.
its 2:20am at 10 am i have exam,so jai shree ram,aur jai baba raj
College which year ??
Kasa gya?😂😂
@@Ankit-mg3ge 3rd
@@cocacola37281 got an A grade
understood. You explain in very lucid language
This is a very good explanation.
With help of explanation itself I'm able to code and did the sorting.
Really appreciate the efforts.
You are the best man... I donot know where this energy come from...
khub sundar, osadharon🙂
Understood everything and it became crystal clear topic
Really Thanks to You Sir , Got all my PRoblems Cleared in this Video
Thanks for this ❤❤
Striver, Your content is truly outstanding and incredibly informative! Always thank you for your relentless hard work and consistently delivering the best content.❤
Explanation is amazing 😍
27:35 while computing time complexity for worst case, we do n-1 swaps in 1st iteration then n-2 swaps in 2nd iteration then n-3 swaps in 3rd iteration ...... 1 swap in
(n-1)th iteration so its 1+2+3+......+(n-2)+(n-1) now if we apply sum of n natural numbers we have to substitute n=n-1 so the formula becomes n(n-1)/2 and not n(n+1)/2 as u given. Thanks.
Understood.
Thanks for your commitment. That in itself is amazing motivation to keep going.
UNDERSTOOD
Insertion sort itna easily kabhi samjh ni aaya tha
Amazing content :)
Thank you Striver, I am in my first year but I am learning a lot from you.
Quality content....
Explained effectively and completely..
Best video on sorting
Back in 2019, in my 3rd semester, I had "DSA" as a subject, in my entire college life that's the only paper I got arrear.
It made me feel like the "Computer Science Dept" is not for me.
After a few years, my job demanded me learn DSA, and my friend suggested your website.
You are breaking my inferiority complex in DSA.
Thanks Champ!
understood!!!
Thanks Striver bhaiya
Absolutely understood Stiver!💌
UNDERSTOOD !!
Understood. Best explanations for every sorting algo :)
Understood sir...thank you😇
Awesome work Striver! Much appreciation from Pakistan!
UNDERSTOOD. THE WAY YOU TEACH IS BRILLIANT.
Understood, great lecture.
UNDERSTOOD. Thanks for giving us this course!
simple and to the point, thank you :)
I just wanna say Thank U you are a big brother figure for me...
you are amazing
all the sorting you taught looks very easy after watching your vdo
Amazing course 🤩
Very Nice explanation sir, Thank you!
Best Explaination of Insertion Sort!!!
Good Explanation in the Sorting algorithm. Thanks a Lot❤❤ Strivers
understood totally, literally I forgot my phone while your lecture. Thanks a lot
Thanks for this lecture finally understood those sorting techniques
Understood,thanks striver for this amazing video.
Completed the sorting - I , thank you for the breif explaination bhaiya.
thanks for this lecture ,,,, understood everything
Understood, thanks STRIVER
Why do you do this for free u deserve much success in your life
excellent teaching
Best Sorting video until Now THanks bhaiya...
understood it way better than anywhere else
Understood
Thanks for this video bhai!
you're the best man🔥
your explanation is just Awesome. UNDERSTOOD
Bro seriously Love You 💘💘
We are lucky to be in Striver's era >>>
Today's lesson is that in insertion sort if I have used for loop internal loop instead of while loop then I couldn't have got the best time complexity in case of already sorted array
super anna
your teachning level = excellent;
int a = 10;
int b = 30;
// Swapping in a line
b = a + b - (a=b);
thanks for explaining with this siplicity
Take love from Bangladesh.Understood everything
Thank you sir for your dedication and efforts.❤
understood
Thank you so much for giving this fabulous course.
Thank you so much striver. Your each and every video is such nice 👍
I clearly understood, Thank you
Selection Sort TC -> worst - O(N^2) best - O(N^2)
2:45 - Selection Sort
6:50 - pseudo code / implementation for selection sort
14:28 - C++ code for selection sort
Bubble Sort TC -> worst - O(N^2) best - O(N)
17:41 - Bubble Sort
22:00 - pseudo code / implementation for bubble sort
25:52 - C++ code for bubble sort
Insertion Sort TC -> worst - O(N^2) best - O(N)
31:40 - Insertion Sort
36:55 - pseudo code / implementation for insertion sort
38:52 - C++ code for insertion sort
Understood and thanks
Great explanation......clear cut explanation👏👏👏