Quicksort | C++ Example

[@anilkumar4u2506]

Thank you very much for the detailed explanation, finally I understood the quick sort algorithm

[@RatedA4Aliens]

@3:00 Confused as to why you changed the order of elements when pivot at last index (value 5), shouldn't the order be 5,6,7 instead of 5,7,6 ?

[@VeronFujimori]

If you describe the algoritm, you will find that the variable i = low at the 6 and the high at the 5. So, they swapped and become 5 7 6.

[@dwivedys]

Had the exact same confusion

[@luizzzda8760]

thank you for the explain this type of sorting. so very clean and help me very much :D

[@levondarbinyan3934]

Thank you for good explanation. I have a question about the last part. We randomly swap the last element of the array, just in case it was sorted already - correct? Why do we want to choose the index randomly? Why can't we just take the middle index between high and low?

[@Holsp]

What if the biggest index is in the middle? You just push it to the back and the whole cycle of getting the bad pivot continues, just from the second iteration.

[@hanniamartinezadame8125]

Tysm!! This is amazing

[@Silentema]

Muchas gracias amigo, apesar de que el ingles no es mi idioma, pude entender a la perfeccion el tutorial. like y me suscribo

[@tsan8822]

My head exploded sir
Btw ty for explanation

[@dwivedys]

Whoa!!

[@martin6101]

stary popici to je very good

[@katlehotsotetsi8335]

Thank you

[@PortfolioCourses]

You’re welcome! :-)

[@VeronFujimori]

thank you sir

[@PortfolioCourses]

You’re welcome! :-)