Quick Sort uses a divide-and-conquer strategy by selecting a pivot element and partitioning the array so that elements smaller than the pivot come before it and larger elements come after.
The algorithm then recursively sorts the sub-arrays on either side of the pivot until the entire array is sorted.
š” Tip: Watch how the pivot gets placed in its final sorted position after each partition!