QuickSort Algorithm and concepts

Explanation of QuickSort algorithm with example ( ADA)

[yashmishra]

I love the way you say correct at 1:57

[nikhiljadhav]

This is very easy and soffisticated your video i understad . plz mam can if you add more videos on soft computing its very imp.for software engineering and AI.
plz mam aap isi method our isi tarike se biological tricks or example leke sikhaiye our helpfull hoga . main ap ka soft computing ke videos ka wait krunga.
thank you very much mam!

[amankayat]

Kya 5 aur 6 ko bina koi logic k swap krva diya ....🤔🤔

[prabhuprabhat_bhatia]

I watched many YouTube videos for the same and got really fed up but then yours channel gave a shine.The topic seems easy due to your explanation and voice. Eventhough it took approx. 2 hrs for me to do it completely.
Also I guess, there's a MISTAKE in partition algo viz in step 2 P index must be assigned as start-1.
THANKS MAM FOR THE VIDEO.RIP Tomorrow is my sessional and still more than 50% sylabbus is left.

[SmartProgramming]

nice one mam, the way you have explained is really awesome, keep it up, thank you 👍👍🙂🙂

[manoButterfly]

at 4:09 but this not sorted array how can you skip to algorithm??? :( what happend to 6 and 7... last 3 elements are 5, 7, 6 ??? why?

[vishavgupta]

Very nice
Excellent than other confusing tutorials

[ShridarKurani]

@4:35 pindex = partition(Array, start, end). Partition function returns value of pindex.

[soumenmanna]

clear voice mam....easily explained...thnks

[mandirakashyapi]

nice explanation it helps me a lot thnq mam

[charankumar]

I understood and nothing matters, thanks.

[VishalKumar]

ur voice hve some magic to learn easily...thx..

[mariahafeezartanddrawing]

Siso wo bht tough krwate o bnda asy krwai jsy one class k bchy ko krwaty smj b ay taky

[Mengroomingathome]

At 4:12 mam apki list abhi sort nahey Hui ha finally the sorted list is 2, 3, 4, 5, 6, 7

[pinjuhsaikia]

Without any reason /rule how can you swap two value?

[bhagvanjibhaivaghela]

Galat kiya hai last mai to 6 last me hai or 7 second last aisa nahi hota

[samenimran]

we are not comparing element in the start of algo actually we are comparing index mam

[premmishra]

Is this necessary that last element always be pivot element ? And how u can swap 5and 6 illogically
Please solve this array through quick sort
5, 2, 1, 4, 3, 6, 7
Please reply

[roshnimansore]

mem yadi first element hi less than pivot ho to kaise swap hoga kyoki i=0 and pindex=0 please mem reply

[Mengroomingathome]

4:09 3 is greater than 2 not a sorted list