Mastery Points

Quick Sort in dsa

Context & Logic

Quick Sort partitions the array around a 'pivot' element.

Example

function quickSort(arr) {
    if (arr.length <= 1) return arr;
    let pivot = arr[arr.length - 1], left = [], right = [];
    for (let i = 0; i < arr.length - 1; i++) (arr[i] < pivot) ? left.push(arr[i]) : right.push(arr[i]);
    return [...quickSort(left), pivot, ...quickSort(right)];
}

Step-by-Step Logic

Select a pivot and partition.

Recursively sort the partitions.

Complexity Metrics

Time Efficiency

O(n log n) average

Memory Footprint

O(log n)