2.8.1 QuickSort Algorithm

i have no idea what hes saying

Thanks a lot for this video. I watched two other explanations that took slightly different routes and were confusing.
Your explanation was concise, easy to follow and to the point.

is it correct when you say when I<than j swap? isn't supposed to be if I becomes greater than j?

makasih lord bari

Thanks!

সেরা

Wow, so elegant.

Abdul Bari Bhai,
For the past 3 days I was having Error in my code and wasn't able to figure it out but after seeing and implementing your algorithm, I finally sorted the Error and now my Program works perfectly.
Thank you Brother,
Lots of cheers to you 🫡

lovelyyyyy

Very good and simple explaination. Only mistake is that the pivot should be placed at the end of the array and should be swaped with i instead of j.

Sir the partition algo isnt correct at the base level. I just tried coding it the while loops doesnt work as expected for smallest iteration

Such a great teacher in my life one day I will be meet u sir 🙏🙏

sir can you please explain the quicksort iteratively

wow made it easy for me thanks

Nice

Thank you very much sir❤

I like when he stops and stares deeply into my eyes until I understand.

this is the best video for quick sort. Thank you

If I give input as 5 4 3 2 1 to be sorted -- then partition logic will fail as we are doing
do while with just a condition A[i] <= pivot
& keep on incrementing i . this will go beyond the array boundary.? It should also have condition that i < j or i < h

Simple and easy to digest explanation.

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🎉

It's really concise and understandable. Thanks a lot.

Do we nnecessary need to have a infinity value?

😍😍😍

in do while loop don't we need to check for bounday as well? exact algorithm gave me out of index exception with [10, 3]

Thank you very much sir! I always dreaded quicksort from the name of it, but you explained it so beautifully!

Thanks sir because of you I’ve cleaned my DAA exam

U made this algorithm quick to understand❤

Thank you from Algeria 🇩🇿

fucking genius

If anyone had a problem where the last element in the array isn't sorted, just replace the do while loop with a regular while loop.

Legend

I applied the algorithm on the array [8 4 6 5 0 1] and it wasn't perfect until I changed the condition while(a[i]<=pivot) to while(i<j && a[i]<=pivot) Maybe I didn't get the trick behind the INFINITY. This tutorial has really demystified this topic. Kudos

Abdul Bari sir is a living legend of DSA

Can you make videos for design and analysis of algorithm?

bless this individual

😢 Abdul Bari. That's a clear explanation. I am trying to under that speration part for 4 hours. You nailed it in 13 min

Thank You Sir 😊

Great video!

In the first do-while loop, do { i++ } while(a[i] <= pivot), it should use the less than operator (<) instead of less than or equal to (<=) to maintain correctness. This ensures that the pivot element stays in its correct position and prevents potential infinite loops if there are consecutive duplicate pivot elements.

Ye toh Abdul Bari hai, ye toh accha bacha hai, ye algorithm padhta hai, acchi baatein batata hai🤲

thank you sir

I think at 10: 15, you are writing the incorrect condition. I think it should be A[i] > pivot and A[j] < pivot. Correct me if I am wrong but this could just be a typo. Thoughts?

Thank you sir very much sir ❤

excellent explanation

we all came here after our lecture on sorting algorithms lets be real here

This is an Amazing Video