Quick Sort
Quick Sort is an in-place and a “Divide and Conquer” algorithm.
Published in
2 min readSep 5, 2022
It works by partitioning the array into two subparts, one lesser and one greater than the pivot, and calling the function recursively on the two parts. There are many different versions of Quick Sort depending on how you choose the pivot (1st element, last one, in the middle, …).
