Visualize Quick Sort step by step. Watch how a pivot is chosen, elements are partitioned around it, and the algorithm recursively sorts each partition in-place.
Quick Sort selects a "pivot" element, partitions the array so elements smaller than the pivot come before it and larger after it, then recursively sorts each partition.
Select an element from the array to act as the pivot (commonly the last element).
Rearrange: all elements smaller than the pivot go left, larger go right.
Recursively apply the same logic to the left and right sub-arrays.
Quick Sort is often faster in practice than Merge Sort because of better cache behavior, but it is unstable.