Quick Sort super easy explanation with animations and example | Full implementation and code

[@jarvoo69]

I spend my money in the DSA course (lol). now i am getting better understand from nikhil bhaiya

[@davidhh7416]

This is the exact great and clear step by step code explanation with array animation I was looking for!!! Can’t thank you enough!!!

[@nikoo28]

Great to hear! If you really want to help out share this video with anyone you feel it would be helpful to. This certainly motivates me to make more such videos.

[@sumitbabel5415]

Really explained in an exceptionally well manner, your effort and explanation is really respectable and commendable.God Bless dude

[@nikoo28]

You are most welcome

[@rohandhobale2691]

Good explanation

[@samwelino]

Watched many videos on Quick Sort algorithm, and your video is the one of the best, thank you!

[@nikoo28]

Glad it was helpful!

[@nicholasswandrak3051]

This is the video that I needed. Explained it very well and helped me out so much. Thank you!!

[@nikoo28]

You are so welcome!

[@Priyutube]

sir your videos are always very helpful for understanding the concept keep posting new video thank you so much sir

[@matthewzarate8851]

Amazing explanation Nikhil, thanks!

[@something......something3844]

Bro, this is the best explanation on quick sort bro. Thank you

[@nikoo28]

So delighted to hear that

[@pranaym143]

Thumbnail is dope

[@irakeshdeka]

Thanks Nikhil ❤️.

[@shankar7435]

Swap (arr, i, j) should be done only when i != j. if(i != j) swap(arr, i, j); should save from some unnecessary swaps. I found an even more efficient approach. This does not make the current video any less in giving a better understanding of Quick sort. kzbin.info/www/bejne/nmnIqoxtma6chJYsi=IdRX8luO5JbLaFuA Both together made me understand what the Quick Sort is all about. Thanks a lot for the video.