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.
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. th-cam.com/video/h8eyY7dIiN4/w-d-xo.htmlsi=IdRX8luO5JbLaFuA Both together made me understand what the Quick Sort is all about. Thanks a lot for the video.
I spend my money in the DSA course (lol).
now i am getting better understand from nikhil bhaiya
This is the exact great and clear step by step code explanation with array animation I was looking for!!! Can’t thank you enough!!!
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.
Watched many videos on Quick Sort algorithm, and your video is the one of the best, thank you!
Glad it was helpful!
sir your videos are always very helpful for understanding the concept
keep posting new video
thank you so much sir
Really explained in an exceptionally well manner, your effort and explanation is really respectable and commendable.God Bless dude
You are most welcome
This is the video that I needed. Explained it very well and helped me out so much. Thank you!!
You are so welcome!
Good explanation
Amazing explanation Nikhil, thanks!
Bro, this is the best explanation on quick sort bro. Thank you
So delighted to hear that
Thumbnail is dope
Thanks Nikhil ❤️.
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.
th-cam.com/video/h8eyY7dIiN4/w-d-xo.htmlsi=IdRX8luO5JbLaFuA
Both together made me understand what the Quick Sort is all about.
Thanks a lot for the video.