DSA · Theory

Quick Sort Using Hoare's Partition

Theory

348/810

Quick Sort Using Hoare's Partition

Quick Sort Using Hoare's Partition is a DSA topic. In plain words you use it for names A→Z in the roll list. Don’t start with a slogan — start with that picture.

Smallest example: n log n vs n². Type it, run it, and say what you see. If you can do that from memory, you know Quick Sort Using Hoare's Partition.

From the example next to this theory: Quick Sort Using Hoare's Partition — quick sort partitions around a pivot, then sorts both sides.

Trap — unstable sort when equal keys matter. Fix that before you talk about advanced DSA.

Viva — what is Quick Sort Using Hoare's Partition? Then show n log n vs n². Then name the trap.

Exam tip

What is Quick Sort Using Hoare's Partition? Show this: n log n vs n². Trap: unstable sort when equal keys matter.

Example

def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    pivot = arr[len(arr) // 2]
    left = [x for x in arr if x < pivot]
    mid = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]
    return quick_sort(left) + mid + quick_sort(right)

print(quick_sort([5, 1, 4, 2, 3]))

Quick Sort Using Hoare's Partition — quick sort partitions around a pivot, then sorts both sides.

Short notes

DefQuick Sort Using Hoare's Partition — names A→Z in the roll list.
Rulen log n vs n²
Trapunstable sort when equal keys matter
Usethe roll list

def quick_sort(arr): if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] mid = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quick_sort(left) + mid + quick_sort(right) print(quick_sort([5, 1, 4, 2, 3]))

Quick Sort Using Hoare's Partition

Example

Short notes

Questions

Quick Sort Using Hoare's Partition

Example

Short notes

Questions