Quick Sort Part 1 (Partitioning Procedure) Design and Analysis of Algorithms

These videos are helpful for the following Examinations - GATE Computer Science, GATE Electronics and Communication, NTA UGC NET Computer Science & Applications, ISRO, DRDO, NIELIT, Placement Preparation, etc.

#Call_9821876104 #GATE #NTAUGCNET

[nitishnirala]

Thank you sir for sharing your
I like your teaching

[surajregmi]

I had seen many videos previously and they made this simple algorithm look confusingly difficult. It is wonderful how easily and clearly you described. Kudos!

[shahreyaryahya]

sometimes numbers of subscribers or likes or views doesn't determine how much a is gonna helpful for u....nice you sir.

[kavita_maheshwari]

By seeing the likes..I thought it will not good, as I had previously watched 3 or 4 videos of this concept, and they are not so worthy.
But this is nice, nd making me Understandable.
Thanku

[saketparashar]

the problem was solved right at 3:29 in the video and rest was just for the practice this how a problem should be solved or at least described thank you sir for such a easy to understand method

[Vakti]

my teacher needed 50 mins and u only 13 mins :)

[inclinedscorpio]

You did made me understand which the rest of the 14 videos did not ....;

[flytoraghu]

Thank you very much. Very good explanation.

[babitachaudhary]

thank you sir your giving good explanation

[abhishekshanu]

after swap (A[i]A[j])you have to use j++ in algorithm section

[ShivamPanchbhai]

Sir can you please make a video on prims algorithm covering it's c program also.

[tejalchaudhari]

it's called "pivet" (pivət/)pronunciation is wrong. over all explanation is good.

[sarojsonkusare]

sir can u pls tell me why we chose the last elements as pivot???

[laetitiamed]

It's not a good algorithm because in the case, the condition inside the for loop never occurs we return i which is -1 and we are out of the array ! I tried it and I have "segmentation falt"

[kevinv]

What if the number is equal to the pivot

[samss]

sir can u plzz provide the java code for quicksort by selecting last element as pivot

[Vishal-ngxb]

If 1st element was smaller than pivot...what would have happened?

[MyRocks]

What will happen if first element of the array is less than pivot...i and j will be in same place...how swaping will be done

[romanbutterman]

blblblblblblblbl Quicksort blblblblblblb oke?