THIS IS ABSOLUTELY SIMPLE AND BRILLIANT EXPLANATION; I CANT THANK YOU ENOUGH SIR, AS IT REMOVED MY FEAR OF QUICKSORT WHAT A SUPERB EXPLANATION WHICH IS EASY TO UNDERSTAND FOR EVERY TYPE OF STUDENT!!!
When i is equal to 4th and j is equal to 5th index then arr[i] < pivot will not satisfy the condition hence i will not be increased. but in video it is explained as i value got increased. Please check.
you are great sir, your best part of teaching is you go through the dry run of program and its easy to understand for learning. thank you so much sir.
Thank you so much sir, aapke jaisa teacher mil jaye to har student coding sikh jaye
Sir, You have helped me a lot which I can not ever in my life . Thank you Sir a lot.🙏🙏🙏🙏🙏🙏🌹🌹🌹🌹🌹
Brilliant. I wish could have teachers like you or you tube facility when did Btech.
We seriously need teachers like you.
sir, I thoroughly learned my programming skills from you. we all will love if the content is more for programs. Like little bit advance programs and with API's also. Thank you for your help :-)
I took course of Advance Algorithms still here several times for clearing doubts.
What if the smallest value present at middle.and also we take that value as pivote? Such as 3 2 1 4 5 6 And 1 is pivote
Sir you are great ...you helped me to overcome my fears in java 💐💐
thank you sir,,you made sorting algorithms simple clear explanation and easy explanation
Hi sir..., I'm not getting the line of code u write that is in recursion If (low<pi-1) And If(pi<high) My qsn is where the pi-1 and pi will points...?
Dassu logic hai,mazza aa gaya
This is a best way of teaching Sir
Superb sirji we need more professor like you... if possible then please Link List aur Tree pe bhi video banao once again thanks..
Thank you so much for your help and I appreciate it alot
He is master and very good from other YouTubers. Please make tutorial for us. From Pakistan.
Please sir make the video on other data structure program like as linked list, stack etc.
@SmartProgramming