Тёмный

2.8.1 QuickSort Algorithm 

Abdul Bari
Подписаться 1 млн
Просмотров 3,2 млн
50% 1

Quick Sort Algorithm Explained
PATREON : www.patreon.co...
Courses on Udemy
================
Java Programming
www.udemy.com/...
Data Structures using C and C++
www.udemy.com/...
C++ Programming
www.udemy.com/...

Опубликовано:

 

26 сен 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 1,7 тыс.   
@anthonyisensee
@anthonyisensee 3 года назад
When he quietly said "that's it" I couldn't help but laugh. Because that's the most popular sorting algorithm in computer science, excellently explained in 13 minutes. That is indeed it, my fine sir. Thank you.
@repvoo2399
@repvoo2399 Год назад
What is there to laugh about it?
@Chaos_Nova
@Chaos_Nova Год назад
@@repvoo2399 bitter…
@sandro-of9fq
@sandro-of9fq Год назад
​@@repvoo2399 laugh of joy.
@dhanush9570
@dhanush9570 Год назад
@@repvoo2399 bruh🙄
@SanilJadhav711
@SanilJadhav711 Год назад
@@repvoo2399 He literally mentioned in the comment itself why he laughed 🗿 your question comes off real negative ngl
@shubhamn2690
@shubhamn2690 4 года назад
Your timing of taking pauses while teaching is just sooo right! It allows the viewer to process the information right at the time when it's needed.
@MrRobot-gm9cv
@MrRobot-gm9cv 5 лет назад
Abdul Bari, you're honestly such a talented teacher. Please don't stop making these type of videos. You are an angel sent from god.
@DonBeleren
@DonBeleren 4 года назад
I toooooootally agree!! He rocks!
@parthvasoya3562
@parthvasoya3562 4 года назад
Awesome man, just awesome
@kusumaseera3753
@kusumaseera3753 4 года назад
Yes
@mittalji919
@mittalji919 4 года назад
this man has saved us from getting fail in ds and algo😂😂
@madhumithak3338
@madhumithak3338 4 года назад
yes....He passed me in the exam....Very Thank you sir
@seanpayne9124
@seanpayne9124 3 года назад
I don't know if you still read these comments, but this explanation was so clear and concise. I really appreciate it.
@a-cah1423
@a-cah1423 2 года назад
He dropped a hint.
@Lunixed
@Lunixed 5 лет назад
I pay more than one thousand dollars to my algorithm analysis Professor here in the United States and I don't understand a single word that man says but you, for FREE have guided me through the whole entire course... I wish I could pay you instead. Thank you so much for the lectures.
@NeverQuitOk
@NeverQuitOk 5 лет назад
Teaching is a skill which is gifted by God. Now a days so called teachers are spoiling education system. The talented professional teacher are rarely found in college. Only business they want, not quality
@modelingandsimulation6941
@modelingandsimulation6941 4 года назад
Feel the same
@fatehmammadli7336
@fatehmammadli7336 4 года назад
He has patreon
@abkyabacha
@abkyabacha 4 года назад
Yes, I bought his Udemy course of DS and Algos even though I didn't need it.
@sid_sipani
@sid_sipani 4 года назад
@@srujohn652 Arey bhai kuch toh sharam kar le xD
@turtlepedia5149
@turtlepedia5149 3 года назад
Sir not only in INDIA but you are helping students all over the world 🔥🔥respect ++
@NirmalSilwal
@NirmalSilwal 3 года назад
watching from Nepal
@RAMAMUHAMMADMURSHAL
@RAMAMUHAMMADMURSHAL 3 года назад
Wathcing from Indonesia
@okaybossiamonyoutubeakkskd
@okaybossiamonyoutubeakkskd Год назад
@@dipankar9700 nice one dipankar
@LocNguyen-mn4dd
@LocNguyen-mn4dd Год назад
watching from VietNam
@jethrocenas3120
@jethrocenas3120 Год назад
++respect
@kimjiyoung8655
@kimjiyoung8655 3 года назад
Hi Abdul. Im Korean who is learning computer science here in Denmark. I have actually watched more than 30 different quick sort tutorials, and can definitely say your the best. it helps A Lot, thank you so much. 😘😘😘
@abhirajarora7631
@abhirajarora7631 2 года назад
Korean in Denmark and leaning topics on RU-vid with the help of an Indian teacher. Truly a globalized world!
@techtronics6121
@techtronics6121 2 года назад
You should give respect to Sir. Is he your same age or junior that u talk to him like, hi Abdul?
@kimjiyoung8655
@kimjiyoung8655 2 года назад
@@techtronics6121 🤣sorry I'm living in Denmark, and we are 'Allowed' to call each others name and of course say "hi" regardless of their age, gender, race or their job. I can see you are SICK.😂 poor thing
@KnowledgeIsGold
@KnowledgeIsGold Год назад
@@techtronics6121 fk your mom
@movocode
@movocode Год назад
@@techtronics6121 In foreign countries it's quite normal - people even call ceo's by their first name.
@thexxmaster
@thexxmaster 4 года назад
Indian youtubers are the backbone of the new KNOWLEDGE ECONOMY
@danialhaziq7761
@danialhaziq7761 3 года назад
FACTS!!!
@teratoma.
@teratoma. 3 года назад
word
@anubhavsingh9049
@anubhavsingh9049 3 года назад
No
@putinscat1208
@putinscat1208 2 года назад
This teacher is very clear, and shows all the steps. And, he doesn't get into his religious, political, or personal stuff, he doesn't get distracted by pets coming into the video, etc. Unlike you.
@Sanyu-Tumusiime
@Sanyu-Tumusiime 2 года назад
@Tharun tharun My country doesn't even have a education here in Africa. This is legit premium super first class for free here on youtube i'm so glas that people like him exist
@MegaGemoroy
@MegaGemoroy 3 года назад
Thank you Mr Bari, not only you are very knowledgeable in this field but you are also able to communicate it in an easy to understand way. A great educator. You are a legend in our faculty, everybody knows you and respects your work.
@abdul_bari
@abdul_bari 3 года назад
So nice of you
@alperozdamar517
@alperozdamar517 4 года назад
You are the best teacher in algortihm, I've ever seen. Albert Einstein has a saying "If you can't explain it simply, you don't understand it well enough." Since I saw this video, I was so confused. Actually, I realize that it is very easy. You made my mind flashed. Thank you Abdul.
@vibhutisahu5376
@vibhutisahu5376 28 дней назад
7:07 when you take pause, I am getting how deeply you have dive into each and every topic with details.... this type of control only comes up with the lots of patience, dedication and passion towards the thing what you love to do as a teacher...Huge respect for you Abdul Sir... It's my pleasure to study DAA from you in a such smoother way
@echoesofelysium18
@echoesofelysium18 4 года назад
Hi, the topic is Quick Sort. And thank you for watching the video. No asking for likes and subscribers and showing the bell icon thingy in the middle of the video. Perfect teacher. Not even expecting personal benefits. Hats off to you sir.
@fitnesstravelwithdm4541
@fitnesstravelwithdm4541 5 лет назад
Happy teacher's day sir 😊..Hope you remember , you came to our college (Ideal institute of Engineering , Kalyani)..I was in the first bench attending your lecture..By your free you tube lectures on algorithm , many students are benefited.. without doubt Design and Analysis of Algorithms is tough subject to understand , but you made it easy to understand..On the behalf of the students , thanks​ a lot sir 😊.
@raviramasath2421
@raviramasath2421 2 года назад
Please tamil teaching
@calebhoward4718
@calebhoward4718 2 года назад
I have never been more grateful, I have used a couple of your videos to better grasp the concepts and always came out with it sticking. Thank you for these videos, they have helped me significantly!
@manojprabhakaranm5752
@manojprabhakaranm5752 5 лет назад
That look you give after each explanation 😂 that gives me satisfaction 😁 U R great sir
@masoom5320
@masoom5320 4 года назад
😂😂😂😂😂😂😂😂
@kartashuvit4971
@kartashuvit4971 2 года назад
Great explanation. FYI if anyone is struggling implementing this even after following his pseudocode, it's because you need to add an extra check in the do-while loops. You need to first check if i < length(A) before checking A[i] -1 first. Otherwise your extreme left/right partitions can run out of bounds.
@ashutoshchoudhari9630
@ashutoshchoudhari9630 2 года назад
if i < high and j > low. This should be the condition
@Sedri14
@Sedri14 Год назад
@@ashutoshchoudhari9630 Thanks, that's exactly what I needed
@taskunter_dev
@taskunter_dev 4 года назад
I watched quite a few online tutorials and spent so much time at the uni's classes, but I have never met such a talented teacher as you are! Thank you! :)
@bilalshafqat1634
@bilalshafqat1634 4 года назад
Fantastic, what a way to explain. I have no words. I passed my Data Structure course and my degree with A grade but I was never able to understand quick sort from the slides. Today I went through this video and damn. Excellent job.
@fatimanasir1502
@fatimanasir1502 2 года назад
This was like eating up the whole algorithm in 13 minutes, thank you so much for making it seem almost effortless.
@taaihone6881
@taaihone6881 3 года назад
After watching 5 videos on Quicksort, this is the one that actually clicked for me. Big thanks!
@_sarthakmisal
@_sarthakmisal 2 месяца назад
Congratulations for 1M Abdul sir
@adriandsouza5735
@adriandsouza5735 2 года назад
I passed my master's degree with distinction after learning concepts from these videos. Thanks a lot sir ....
@aakashdahal8207
@aakashdahal8207 4 года назад
Sir, I am from Nepal and my DAA exam was yesterday.Watching your videos were of great help.You really are a good teacher..My all friends study watching ur video...Sukriya
@vishwam7928
@vishwam7928 4 года назад
Within 3 min you gave almost 90% idea and understanding of the algorithm, fantastic.
@LiquidMasti
@LiquidMasti 5 лет назад
my professor took 2h to teach quick sort and still don't understand quick sort than i came here only 13min of video clear my concept. thanks andul sir big fan
@adrian716
@adrian716 4 года назад
Thank you, sir. When I don't understand something at the university, I know you're here to save me. Great explanation!
@s.m.saifulislambadhon2654
@s.m.saifulislambadhon2654 4 года назад
His calmness is making everything easier and easier
@dinuka
@dinuka 3 года назад
came here after reading so many articles about quicksort and without understanding anything. got the idea in a few minutes after watching your explanation. best video to learn quicksort.
@maliktarannum5418
@maliktarannum5418 6 лет назад
I watched so many videos got irritated but didn't understand it....finally your video has cleared this concept thank u so very much ...very nice 🖒
@sumedhdeshpande3420
@sumedhdeshpande3420 3 года назад
Please add this to the description. 0:00 Idea behind Quicksort 03:03 Quicksort Definition 04:00 Procedure of Quicksort/Working of Quicksort 09:15 pseudo-code for Quicksort/Logical implementation of quicksort
@Saurabh5989
@Saurabh5989 3 года назад
I have seen videos and articles of many renowned people with no luck but then finally I landed your channel to get one stop concrete explanation to all complex algorithms. Thanks a lot sir. I was understanding the approach behind but was unable to appreciate the concept behind these.
@Shambo271
@Shambo271 5 лет назад
You, Sir, were put on this earth to help us all get better! Your teaching style is exceptional. Thank you.
@boombasach
@boombasach 2 года назад
I wish I had a time machine to take you back in classroom 25 yrs back. Keep doing, you're an inspiration
@parameshwarannatarajan3785
@parameshwarannatarajan3785 2 года назад
This is God level explanation. I could write this code in one iteration. You are making computer science knowledge accessible to all.Thank you sir , looking forward to more such content 🙏
@shobhitranjan8680
@shobhitranjan8680 Месяц назад
you are creator of many youtubers , who are taking thousands from us to teach same thing. eg-> Love babbar, TUF, Apna College and many more
@praveersharan3775
@praveersharan3775 5 лет назад
this is awesome. seriously. this guy knows how to teach.
@nikunjmishra5817
@nikunjmishra5817 3 года назад
Mark my words today....no one can explain quick sort better & in such a small, crisp & to the point manner.....sir you have made these algorithms such a cakewalk....you are just a gem for college students....
@maqeelkhader
@maqeelkhader 4 года назад
The need for infinity can be better explained by noticing that the first while loop will never end in case the input is sorted in descending order {5,4,3,2,1} . Infinity is a trick to prevent that situation here.
@prathamkushwah1670
@prathamkushwah1670 2 года назад
I dont know which test case you are using but this algo works fine without using INFINITY in the last position. It worked for [5 4 3 2 1], the test case you mentioned (without infinity).
@anitsarker4591
@anitsarker4591 2 года назад
@@prathamkushwah1670no it doesn’t work because i will continue incrementing until gets index out of if bound exception, because the first is the max element in the array, and no other element is bigger than it on the right hand side.
@asmo_1929
@asmo_1929 2 года назад
@@anitsarker4591 If it reaches infinity it will give an out of bounds exception anyway because position h is outside the array, I added a condition sa that it doesn't reach past h
@vanchark
@vanchark 2 года назад
you can alternatively check if i ever crosses j (i.e., while i
@metulusoy
@metulusoy 8 месяцев назад
This discussion should be higher. I also spent time to understand if infinity is necessary and based on this example, I will try it myself.
@dineshshekhawat2021
@dineshshekhawat2021 3 года назад
This is the best explanation for quick sort I have ever seen. Crystal clear and understood in one watch.
@EddieKnaz
@EddieKnaz 4 года назад
do{ i++; } while(A[i] pivot) will cause index out of bound.. easily given an array like [8,10] you need to add a condition to each while statement do{ i++; } while(A[i] pivot && j >= left)
@garamburito
@garamburito 3 года назад
this is the commet that I was looking for. Just in case, in Java the range's check condition have to be at the beggining (short circuite). I mean: while(i < right && A[i]
@__ankush_kushwaha
@__ankush_kushwaha 3 месяца назад
yes same error occur but resolve thanks for pointing on the comment section so that everyone can become familiar of that .
@pranavi4324
@pranavi4324 11 месяцев назад
Prompt and excellent explanation. One of the best teachers on RU-vid
@RahulKesharwanialwaysyours
@RahulKesharwanialwaysyours 6 лет назад
I have watched many videos on Quick Sort Tutorials but this is the video which I was finding. Thank you so much for uploading an effective tutorial.
@mansoortmans
@mansoortmans 6 лет назад
Rahul Kesharwani same to me
@marianoduca9839
@marianoduca9839 3 года назад
Amazing, took me 10 minutes to grasp this thing better than 1 year of university ! God bless you
@rishabhsahu5257
@rishabhsahu5257 3 года назад
So true !!! ..Same here
@karanveersingh5535
@karanveersingh5535 3 года назад
Whole 1 year they taught quicksort only 😂
@palakbhardwaj6359
@palakbhardwaj6359 Год назад
bhai tujhe issai pyaar hai
@lasithathilakarathne3205
@lasithathilakarathne3205 2 года назад
"Hi, The topic is Quick Sort". You got me there. My first impression was, you're the most straightforward man I have ever seen in my life.I didn't even want to increase the playback speed. Enjoyed every second of the video and yet, I learned what was taught in a 2-hour confusing lecture, within 14 minutes. Thank you very much sir! and you got yourself a new subscriber.
@marcosrj21
@marcosrj21 2 года назад
Abdul looks like the kind of teacher that is so dedicated that makes you want to learn so you can show your gratitude for his dedication.
@Amir-wp8el
@Amir-wp8el 2 года назад
I don't know if you still read these comments, but this explanation was so clear and good , thank you
@pvtbx4198
@pvtbx4198 2 года назад
This guy has such a comforting vibe for some reason... seems so nice
@alekosthecrow
@alekosthecrow 4 года назад
I love how you sometimes sound like you've already tried to explain it to me like 10 times and I still don't understand
@aishashaik9247
@aishashaik9247 Год назад
Sir it took me 3 months to understand this sorting technique.... But now that I found this video! I clearly understood every pin to pin detail of how it works... Thank you so much for making it so easy sir🎉
@haliluluoglu1188
@haliluluoglu1188 5 лет назад
You're one of the best teacher i have seen.Thank you very much,regards from Turkey.
@linuxguru27
@linuxguru27 4 года назад
iyi usta bulusak egitim cok kolay oleyor
@fashizlecartman
@fashizlecartman 3 года назад
Sir. you are by far the most clear explainer of any computer science topic. hats off to you.
@jabbahiggs7039
@jabbahiggs7039 2 года назад
This is much easier to follow than other videos about quicksort. Thanks!
@punitsalian7190
@punitsalian7190 4 года назад
remember in do{....}while(i < j && A[i]
@amanjethaniya7011
@amanjethaniya7011 4 года назад
i m still getting problem can you provide the code please
@kingofgods898
@kingofgods898 3 года назад
The only man on planet Earth that makes learning CS concepts actually enjoyable
@palakbhardwaj6359
@palakbhardwaj6359 Год назад
u ain't one
@shreza
@shreza 3 года назад
The ease with which you explain the algorithm is just mesmerizing, you make the topic look so simple to understand even if its very complicated. Please do make more videos. It's really very helpful.
@ankitkamble4050
@ankitkamble4050 5 лет назад
Dev maaanusss🙏🙏🙏
@pradeepkumar-qo8lu
@pradeepkumar-qo8lu 5 лет назад
Kharach
@Amankumar-hh1pk
@Amankumar-hh1pk 5 лет назад
Bhaalo maanus 😍
@fahimismailmagdum8468
@fahimismailmagdum8468 5 лет назад
One of the best comment....
@shameemamutallib2769
@shameemamutallib2769 4 года назад
😘good
@moisesacero4995
@moisesacero4995 4 года назад
yes exactly, I thought so as well.
@anushkasingh2735
@anushkasingh2735 3 месяца назад
sir (A[i] > pivot ) and (A[j]
@piratedvirus
@piratedvirus 5 лет назад
After all those months, I finally understand this algo perfectly! Thank You
@mislam2565
@mislam2565 7 месяцев назад
I couldn't understand the internal working of QuickSort algorithm, unless I watched this. Great work! You have broken down the technique so well. Thanks a ton! and keep up the good work.
@sneha.tiwari
@sneha.tiwari 4 года назад
_From last month till now I was damn confused with quicksort_ _and here you explained everything in just 5 minutes_ _thank you so much sir😩😭_
@saurabhbhalla90
@saurabhbhalla90 4 года назад
It's a 14 minute video
@akshayshelke7074
@akshayshelke7074 4 года назад
😂😂
@himanshukoul8615
@himanshukoul8615 6 лет назад
Thanks for uploading this.. just sorted my life
@zAbdullahKhan
@zAbdullahKhan 5 лет назад
I am confused at one point that is i is not less than j and sir is still interchaning i and j values i.e, in first swap i=16 and j=5 so i is not less than j. while in the code it is if(i
@kunalgupta8380
@kunalgupta8380 3 года назад
@@zAbdullahKhan i and j are index not value
@ShaakirKarim
@ShaakirKarim 10 месяцев назад
Understood this concept in 15 mins what professors couldn't teach in 1 lecture , we love you sir you have literally proven that teaching is an art .
@asimchakraborty2930
@asimchakraborty2930 3 года назад
I'm from Bangladesh.. But to know such things Abdul Bari sir is our first choice.. because when he says "That's it".. it means it's really done..
@saravanasai2391
@saravanasai2391 Год назад
😢 Abdul Bari. That's a clear explanation. I am trying to under that speration part for 4 hours. You nailed it in 13 min
@Kunalmarwah2192
@Kunalmarwah2192 5 лет назад
Really loved the way you taught this algo, the best video to learn quick sort. Thankyou so much sir :)
@amritshukla3127
@amritshukla3127 2 года назад
If pivot element is largest element in range l to r this become infinite loop So we also have to add condition i
@indrajeetsingh6882
@indrajeetsingh6882 3 года назад
His slow voice with full of patience is epic
@shwetajha8745
@shwetajha8745 3 года назад
This is the first video I've seen and I think I'll stick around this channel a lot.
@kritisingh2827
@kritisingh2827 5 лет назад
Quick sort really scared me but now after understanding I realise this is so easy
@megr
@megr Год назад
Big thank you for taking a time to share your knowledge and make easier for us to learn. I understood the concept after watching the video, however, there is something that need to be added on both whiles in the Partition function. Just need to check the array indexes, otherwise, we'll exceed the boundaries of the array, something like this: for the i-while while (i < hight && array[i] low && array[j] > pivot); All the rest is just great. Thank you
@abdul_bari
@abdul_bari Год назад
Infinity is used for checking the boundary. If you are using boundary conditions, then no need of infinity.
@megr
@megr Год назад
@@abdul_bari Understood. Big thanks
@faycalsaid702
@faycalsaid702 5 лет назад
Even the teacher didn't succeed to explain to me, thank's a lot now I'm up!
@ajaywadhwa3398
@ajaywadhwa3398 4 года назад
Thank you so much Abdul Bari, You are really comprehensive Teacher. Your videos always clears all the doubts. Your Videos are really helpful to us.
@bmpersonal6403
@bmpersonal6403 3 года назад
Mr Bari, you really are such a talented teacher and individual. I really can't express my gratitude enough for all of these videos. You really make hard concepts easy to digest and I really thank you for that. I have both of your courses C++ and C++ DSA, as Im taking it to supplement my university lectures.
@santosh5336
@santosh5336 3 года назад
He is so confident in the topic like he developed the method. He didn't make a mistake then get back and eraised it
@saahil2121
@saahil2121 4 года назад
Wow. You made something that had confused me so long so simple and clear. Thank you for the video!
@bharat2491
@bharat2491 2 года назад
this is brilliant explanation. So concise and yet so complete. I am reading the idea of infinity in Quick sort for the first time and it was so easy to grasp.
@seemaanjum1472
@seemaanjum1472 6 лет назад
I don't understand why some people have disliked the video. Sir has explained the concept from very basics and his explanations seems very convincing as well.
@harshittaneja471
@harshittaneja471 2 года назад
u don't know he told wrong condition in inner while loop
@P2P_official
@P2P_official 9 месяцев назад
He really explained the topic very well. I've seen many videos but only learnt "how to do" but he's only who taught "why to do". We lack these type of true teachers. 🙌🙌
@jrmaverick181
@jrmaverick181 3 года назад
WONDERFULWONDERFUL.EXCELLENT,EXCELLENT BIG DADDY KEEP IT UP ,YOU ARE FAR FAR BETTER THAN SOME CHIMPANZIES MAKING QUICK IMPRESSION IN THIS FIELD.....
@whatisnew1511
@whatisnew1511 2 года назад
thousands of tutorials in just one video. keep it up you're are an amazing teacher
@gangamvaishnavi1724
@gangamvaishnavi1724 5 лет назад
Sirrr plz come to our college and explain us data structures. We have suchh a worst faculty for data structure 😭😭...super explanation
@osvaldoarellano8904
@osvaldoarellano8904 5 лет назад
Same, I need a professor like this!
@richidubey
@richidubey 5 лет назад
we also hae succh a worst faulty. sair come too
@mouneshvannur6675
@mouneshvannur6675 5 лет назад
@@aadeshmishra5490 it is in ds and daa as well
@ritik84629
@ritik84629 5 лет назад
which college?
@mahfuzurrahman9337
@mahfuzurrahman9337 5 лет назад
which univrsty??
@EC_Ritesh
@EC_Ritesh Год назад
sir you made it look so simple ! ... i can say its the simplest explanation i have surfed for in youtube for quick sort. THANKSS
@AnkitSaiyan
@AnkitSaiyan 5 лет назад
These topics were never so easy! Thank you sir!
@abduljelilali568
@abduljelilali568 2 года назад
the greatest computer science teacher on the web, hats off to you sir!!!!!!!!!!!!!!!!!!!!!!!!!!!!
@psyche5184
@psyche5184 2 года назад
Not only is he good at algorithms, he is good at teaching them to us laymen.
@Darksider95
@Darksider95 Год назад
Sir, i've been spinning around for hours trying to figure out why thrs an infinite loop on my quicksort implementation, and you are the only one that explained on that, to include the pivot for the left sub-array, thank you sir, you are amazing
@focus9099
@focus9099 3 года назад
He protects He attacs But most importantly: he's the best teacher on this earth and he is smart ;)
@ravish5903
@ravish5903 2 года назад
Thanks a lot for explaining in detail. I just got to this video on RU-vid Search for quicksort algorithm. While implementing this method. There was a basic mistake and I spent a couple of hours in understanding those mistakes. In the inner while loops in Partition function, we should also check for boundary conditions. while ($i < $h && a[$i] $l && a[$j] > $pivot) Keep uploading these wonderful videos which explain concepts very clearly... Regards, Ravish.
@aatifnazar8203
@aatifnazar8203 4 года назад
Thank you Sir, these crisp lectures are priceless. How are you doing in this lockdown?
@amitbehera8454
@amitbehera8454 4 года назад
A small change in do-while loop do{ i++; }while(i < h && A[i] l && A[j] > pivot);
@ransam8475
@ransam8475 3 года назад
Your voice is so relaxing sir❤️we can come out of exam stress by ur voice ☺️
@nibedikadhar.official
@nibedikadhar.official 3 года назад
Sir, I've to tell you that you are the best. I mean this explanation was so easy going and great respect for you to make it that flourish.
@Gunslinger962
@Gunslinger962 3 года назад
The whole video I kept waiting for the difficult part that I find hard to understand and then the video ended
@abdul_bari
@abdul_bari 3 года назад
Nice Comment.
@HarshitKumar-bx3pt
@HarshitKumar-bx3pt 2 года назад
I was seaching for the explanation of this algorithm since yesterday. No one could explain me clearly until I saw your explanation. Thank you very much sir 🙏
@kaustubhkislay3126
@kaustubhkislay3126 6 лет назад
I am having one confusion...since we have used do while loop in partition function...so it would increment i by one and decrement j by 1 even if the condition is false and then it will swap those two. So here i think these kind of swapping might create some problems.
@midhunpmathew8090
@midhunpmathew8090 6 лет назад
you are correct Kislay, i = l -1 , j = h + 1 will resolve the problem
@jayantsharma_
@jayantsharma_ 5 лет назад
while(i
@NoobGaming-hj5jk
@NoobGaming-hj5jk 3 года назад
This is the most easiest way I have understood a recursive function. Thank you sir.❤️
@rahulz337
@rahulz337 4 года назад
Very intuitive and easy to understand. I no longer need to memorize this as you made this look so simple. Many thanks :)
@softwarain5674
@softwarain5674 2 года назад
I can't explain how much your videos helped me in this subject please don't stop making these vidoes
@kezhan01
@kezhan01 3 года назад
I think there is a flaw with the two inner while, we need to add i < j before checking A[i] and A[j]
@mpmukundh
@mpmukundh 5 лет назад
Sir I have a small doubt according to element the A[i] values is greater than or equal to pivot Why you put smaller than pivot???
@amargoud45
@amargoud45 5 лет назад
A[i] value is
@atkuriajaykumar3701
@atkuriajaykumar3701 4 года назад
Left side elements should be less than or equal to the pivot element and right side elements should be greater than pivot
@shristigaur1805
@shristigaur1805 4 года назад
@@amargoud45 But here we are checking whether A[i] >=pivot na. Why has he written it in another way?
Далее
2.8.2 QuickSort Analysis
11:37
Просмотров 860 тыс.
Свожу все свои тату (abricoss_a_tyt)
00:35
2.7.2.  Merge Sort Algorithm
24:07
Просмотров 1,7 млн
Quicksort algorithm
20:39
Просмотров 1,8 млн
3. Greedy Method -  Introduction
12:02
Просмотров 1,4 млн
Quick Sort Algorithm
3:27
Просмотров 233 тыс.
3.5 Prims and Kruskals Algorithms - Greedy Method
20:12
Quick Sort For Beginners | Strivers A2Z DSA Course
35:17
Learn Quick Sort in 13 minutes ⚡
13:49
Просмотров 342 тыс.