QuickSort — Coding Interview Preparation — Hackerrank In Top 30 MAANG question — SQL
4 min readOct 26, 2020
- A divide-and-conquer algorithm called Quicksort (also known as Partition Sort)
- We write a method called partition method to split an array into two sub-arrays, one containing smaller elements and one containing larger elements than a given number called pivot.
- When partition is called on an array, two parts of the array get ‘sorted’ with respect to each other. If partition is then called on each sub-array, the array will now be split into four parts. This process…
