Quick Sort - Partition

Video 30 of a series explaining the basic concepts of Data Structures and Algorithms.

This video explains the partition algorithm used in quick sort.

This video is meant for educational purposes only.

[tailaiwang]

a bit more suggestion, this is called the Lomuto's partition, clear this in the title you will get more view. perfect content

[Nickel]

This was very well explained. Thank you

[tomadoni]

best explanations. you can be a great CS professor

[GowthamAllaAP]

i love ur explanation because of ur voice

[tayyabali]

Every video I saw of quick sort they were using the first element greater than pivot but what if the first one becomes less than pivot?

[renujanthanvanenthiran]

What if the first element violate which element do we swap

[renujanthanvanenthiran]

Consider Left sub array after first partition

[ranjithshetty]

Nice explanation but I didn't understand anything

[yunusemreozvarlik]

We are not incrementing "pi" until the swap of 7 and 2. Shouldn't we increment "pi" as well in after every swap, alongside with "i"?

[davlatbekkobiljonov]

so beautiful voice how I deserve such a cool girl explaining such a complex algorithm

hmmm🥰🥰🥰🥰