For those having problem in understanding anything, I would advise you to start practicing questions on any website. Then after sometime, continue with this series and you will find it a bit easier to understand. This worked for me👍
37:28 Minimum 2 elements should be there ( this is what the if condition says ) because if there will be only one element means it already sorted and our code execution will not go inside the IF condition block.
LITERALLY, THE TOUGHEST TOPIC TILL NOW IN DSA COURSE. THOUGH IT TOOK A LITTLE BIT MORE TIME BUT ULTIMATELY UNDERSTOOD COMPLETELY. DID THE DRY RUN TOO, AND THAT MADE THE WHOLE THING CLEARER.
Best guide for Coding🙏Thanks very much bhai...ek hi go me sab clear kar diya...you are very good teacher and it shows that your concepts are super clear🙏🙏May God bless you bhai🙏
Samajh me nahi aa rahi thi to thodi si crochet video dekh k crochet karna Sikh liy uske baad dobara se video dekha toh samajh aa gayi.. aur Harry bhai tum itna acche se samjhate ho ki samajh me to ana hi tha.. bohot kamiyaab ho tum age Jake zindagi mein yehi aasha rakhti hu mera chota bhai...
seriously, one of the toughest topics of DSA till now, and harry bhai has made it so easy for all of us using his creative analogy! love u harry bhai!!
bro is low means zero by default. I mean he didn't create any variables low and high & declare them, how program knows that low =0 and high=size-1 ? pls clarify
Best explaination of quick sort till now. Thank you harry bhaii . You are a great teacher. You exactly know where one would have problem understanding and you make that thing crystal clear. Great hardwork for the explanation.
Literally took two whole days to understand, but when it did. It was the best feeling ever. Thank you harry bhai for the in-depth explaination, WE OWE YOU ONE!
Amazing explanation as always, helped me understand the concept . Keep uploading these types videos and notes, this will be very helpful for students like me who can't understand the concepts in college properly, due to their boring methods. Big fan of yours Harry sir
This is not easy thing to teach quick sort easily but you made it this show your dedication and impressive vast knowledge about coding awesome i like it and thanks for this hard work sir
Sir, According to me this topic better than ur way no one can understand. Bt sir i try this concept to understand so many times bt after watching this video i realise that in this concept nothing is there . And Sir u take the very good examples to thing and concept more clear in a better way. Keep it Sir . My Full Support is with You.
13:40 As per I understand this the code should be one for loop starting from pivot+1 till the end of array which will check for values greater than the pivot value and then stop there and another loop starting from length-1 till the pivot+1 and check for values lesser than the pivot value and then stop there. To stop it we can use the break statement and have a variable to store the values of i and j of that iteration. But what I can't understand is how will I run it again? and if I were to use a while loop to iterate over it then the time complexity of this code will be O(Q(a+b)) which I think is really slow
@Neen s The starting point of j = n-1(for instance 5 -1 = 4) and the starting point of i = low + 1(for instance 0 + 1 = 1) so it basically means that j should always be greater than i for the swap to work between A[i] and A[j]...as soon as j
First thing muze lga ki 50 min ka hai isse skip kr du, then jab video play kiya toh isel leave krne ka thought nhi aaya.... Thank you so much Harry bhai for such a great course 🙏🙏🙏
Java programming me DS par video chahiye please sir Java language ki video pura follow kiye hai jo notes ke sath pdaiye hai or Java One video bhi or purane playlist Java ka bhi . Please Sir DS or algorithm par bhi video chahiye
in chrome browser the F12 Developer tools can be used for hacking and editing websites so please make a video series on its hacking. your videos are greate
while (i < j); // Swap A[low] and A[j] temp = A[low]; A[low] = A[j]; A[j] = temp; return j; how is it while (ij) if we are swapping a[j] with pivot element A[low] ??🤔🤔🤔🤔
the best teacher ever i saw . you explained the topic every eazy. the clg teachers are making to complicated .
Sir ji You'r Debugger of our life ❤️😂
sir maja aa gay
@@thorcoder1 gay?😂🤣😂
Toughest sorting algorithm till now but finally understood just because of harry bhai's hardwork
For those having problem in understanding anything, I would advise you to start practicing questions on any website. Then after sometime, continue with this series and you will find it a bit easier to understand. This worked for me👍
websites like??
@@mohitsharmagarg Hackerrank, codechef, codeforces, etc.
from where r u
@@patrickhudson5168 thankYou
bro DSA hi clear nhi h to question kaise practice krenge.. your suggestion is good but it can be taken vice-versa. (my case)
सर जी, आपका प्रयास प्रसंशनीय हैं।।
सादर प्रणाम स्वीकार करें।। 🙏🙏🙏🙏🙏
Bro you are great one . Aap ke pass difficult ko bhi easily solve krne ka method h...
37:28 Minimum 2 elements should be there ( this is what the if condition says ) because if there will be only one element means it already sorted and our code execution will not go inside the IF condition block.
how can the low become greater than the high in that condition ? Can you help please its confusing me
LITERALLY, THE TOUGHEST TOPIC TILL NOW IN DSA COURSE. THOUGH IT TOOK A LITTLE BIT MORE TIME BUT ULTIMATELY UNDERSTOOD COMPLETELY. DID THE DRY RUN TOO, AND THAT MADE THE WHOLE THING CLEARER.
bhai chilla kya raha hai
@@pranitp.29 Tero ko kya hai reh
@@souled_blink ok
As usual, beautiful explanation of one of the most difficult algorithms
Bhai maine C ar java seekh lii pr quicksort itna detail me smjh ni paya tha....maza agyii yr.. concept baitha diya
Best guide for Coding🙏Thanks very much bhai...ek hi go me sab clear kar diya...you are very good teacher and it shows that your concepts are super clear🙏🙏May God bless you bhai🙏
Samajh me nahi aa rahi thi to thodi si crochet video dekh k crochet karna Sikh liy uske baad dobara se video dekha toh samajh aa gayi.. aur Harry bhai tum itna acche se samjhate ho ki samajh me to ana hi tha.. bohot kamiyaab ho tum age Jake zindagi mein yehi aasha rakhti hu mera chota bhai...
harry bhai ek doubt hai apne bataya ki i aur j jab cross honge tab swap karna hai but apne if mein i
seriously, one of the toughest topics of DSA till now, and harry bhai has made it so easy for all of us using his creative analogy! love u harry bhai!!
Koi batayega yaha do - while loop q lagaya hai
@@harshsingh6451 basically do variables iterate karwa rahe hain with different conditions therefore two while loops
bro is low means zero by default. I mean he didn't create any variables low and high & declare them, how program knows that low =0 and high=size-1 ? pls clarify
sorting sabse easy hoti hai dsa mein'
beta merge sort aur mushkil h
Best explaination of quick sort till now. Thank you harry bhaii . You are a great teacher. You exactly know where one would have problem understanding and you make that thing crystal clear. Great hardwork for the explanation.
Literally took two whole days to understand, but when it did. It was the best feeling ever. Thank you harry bhai for the in-depth explaination, WE OWE YOU ONE!
Mazza aa gya harry bhaii...
Aatma trupt ho gya sham ko...
Dil khush ho gya...
Love you bhaii...♥♥
I haven't seen a better explaination of quick sort than this
Thank you bhaiya
Bahut acha bataya bhaiya ek baar mein samaj aagya
Bhai apki way of explanation is extraordinary. 🙏🙏🙏🙏🙏Salute🙏🙏🙏🙏🙏
Aapke prayas bohot important and helpful h
Thankyou harry bhai quick sort clear hai abhi...........
We people are not only learning dsa, we are learning how to teach as well... ❤️
true
True words
should I teach you😜
You haris khan thara bhai haris khan quick sort ko itna asan banadega itna asan bandega viewers ne sochi na hogi
Amazing explanation as always, helped me understand the concept . Keep uploading these types videos and notes, this will be very helpful for students like me who can't understand the concepts in college properly, due to their boring methods. Big fan of yours Harry sir
the example that u had given at the starting is really helpful to us , thanks
if you don't wanna use do while loop in partition function then use while(i
0:29
sir ji ko apne bachpan ki yaad aa gyi kya bolne wale the awesome sir eise Sikhao
very helpful, make more videos on DSA sir your way of teaching is better then others.
I love this type of desi learning
Sir, you make really good videos. Please continue this DS series. We would be really thankful..
Really nice examples and your hard work is really appreciable 🥰🥰
Yes sir ,such type of anologies make our learning easy ,interesting
Thank you for making the video of quick sort this analogy really helped me to learn and understand the concept of quick sort. Love from Pakistan ❤❤❤
Harry bhai ab to app dil main bath gya ki apki vedio dekhte hi like ki bottom dba deta hoon 🤓🥰🤗😁 .
Love u Harry bhaiya ❤️❤️❤️
In video you explain right but in source code there is decending order
Because of statement in while loop
while (A[i] pivot)
{
j--;
}
This is not easy thing to teach quick sort easily but you made it this show your dedication and impressive vast knowledge about coding awesome i like it and thanks for this hard work sir
➡️01:12 agar tum school gaye ho kabhi GALATISE toh........😂😂😂😂😂this makes me laugh so hard
yeha me to
😂
same 😂
same ..I was watching with my little brother and he burst out laughing 😂🤣
Thank You to my confidence Back sir ...😌
Thank u for such a clear explanation , it helped me a lot, to get how actually this quick sort program works.
Wowww that's amazing harry sir
You explanation method is lajwab...
Sir Your way of teaching is awesome. ❤️😊
Mast way h samjhaane ka
Sir, According to me this topic better than ur way no one can understand.
Bt sir i try this concept to understand so many times bt after watching this video i realise that in this concept nothing is there . And Sir u take the very good examples to thing and concept more clear in a better way.
Keep it Sir .
My Full Support is with You.
I love your teaching methods sir❤️❤️❤️
1st class example hai bhai kaha se late ho ayese examples , samjhate raho just like this.👍
Thank you so much sir for giving code free thank you
Harry Bhai your heart is so big.
What an amazing teacher..Explaining such a tedious concept in a very simple way...Thank you so much Sir..❤️❤️❤️
Harry bhaijaan you are the best teacher 😌😌😌😀 love you bhaijaan that's great explain and 😊😊😊😊
00:27 Yeh bache n itne "HA_NALAYAK" hai....... good cover sir.....🤣🤣🤣🤣
😂😂😂
harami == nalayak;
Lol
@@abhayshankar1427 Yes I totally agree
Looking for this comment after listening the line
Never thought that the swap I learned as basic is soo useful
sir ap difficult se difficult algo ko bhut aasani se smjha dete ho......Thank You
12:34 Aapke examples bahut related hote hain, topics se ❤
Excellent way of teaching
Harry bhaiya done with this thank you 52:11
13:40
As per I understand this the code should be one for loop starting from pivot+1 till the end of array which will check for values greater than the pivot value and then stop there and another loop starting from length-1 till the pivot+1 and check for values lesser than the pivot value and then stop there. To stop it we can use the break statement and have a variable to store the values of i and j of that iteration. But what I can't understand is how will I run it again?
and if I were to use a while loop to iterate over it then the time complexity of this code will be O(Q(a+b)) which I think is really slow
bhai asay hi samjhaya karo acha samajh ata
btw love from Pakistan
thank you are like a big brother for me
you are the best sir,Thanks for presenting it beautifully🥰🥰🥰🥰🥰🥰🥰🥰
highly recommended this channel, sir has explained clearly, after watching his videos i have no doubt
Sir aap bahut mehnat karte hai thanks for your hard work ❤️, humko quick sort samjh aa gya ✌️✌️
Koi batayega yaha do - while loop q lagaya hai
mza aa gya op explanation i watched this video twice and its fully clear to understand 🤩
I have successfully invested my time on right place
sir first teacher hai jo itne easy way me phada ta hai fan ho gya me(:
lovely efforts by you sir,really very interesting and educational
Sir You said in partition point 6 j < i But in code you wrote I < j. Please clarify
@Neen s The starting point of j = n-1(for instance 5 -1 = 4) and the starting point of i = low + 1(for instance 0 + 1 = 1) so it basically means that j should always be greater than i for the swap to work between A[i] and A[j]...as soon as j
Harry bhai thanks a lot for these videos,they help a lot! Please make one on heap sort as well
Harry Bhai u Explain most complicated concepts also in Very very easy way.❤️
harry bro its my humble request pls think about the solving some competitive coding on the dsa after this
First thing muze lga ki 50 min ka hai isse skip kr du, then jab video play kiya toh isel leave krne ka thought nhi aaya....
Thank you so much Harry bhai for such a great course 🙏🙏🙏
thankyou bro for putting so much effort.🤗
Love you brother from Bangladesh. ❤❤
I have watched 200+(till now) videos of Harry bhai, but this was the best
How do you make every topic so simple? Love the way of your teaching
Aap bahut achha samjhte hai bhai Arduino nahi chhutna chahiye bhai please please
I love miss quicksort 😃🥰pyaar ho gya 🥰🥰😃😘😘
Crystal clear explaination
Code debugger of my life - Harry bhaii😍♥💫✨
thank you for everything harty bro
Thank you so much for this awesome
explanation sir!
hey can u tell me prinntarray funtion m array pass kiya h wha * q lgaya h???
Java programming me DS par video chahiye please sir
Java language ki video pura follow kiye hai jo notes ke sath pdaiye hai or Java One video bhi or purane playlist Java ka bhi .
Please Sir DS or algorithm par bhi video chahiye
great vedio
Bhaiya starting me bahut acha trick use Kiya batane ka ab bhulenge nhi thank you bhaiya ❤❤
12.39 apke prayas bohot accha lagta hai
in chrome browser the F12 Developer tools can be used for hacking and editing websites so please make a video series on its hacking.
your videos are greate
Thank you sir you help me to learn very easily
really nice way of teaching
The way u teach is amazing sir.
God Bless You 🙏😇
You are the best!
Dil khush kr diya bro❤❤
best ever video on quick sort
Is Python language okay for software development?
My humble request is to make a video on this.
Nhi h
your analogy are relatable to topic and it also create interest
Thank u ❣️
please make a video on binary tree
In cllg this topic was annoying but now I love this topic 😊😊thanks Bhaiya for making me understand
Harry bhai.... Legend
while (i < j);
// Swap A[low] and A[j]
temp = A[low];
A[low] = A[j];
A[j] = temp;
return j;
how is it while (ij) if we are swapping a[j] with pivot element A[low] ??🤔🤔🤔🤔
Bro while (I
Mast example tha Harry Bhaiya.