quicksort.py

Link

http://nyarlathotep.org/p/Rf3Xb9

Created

2026-08-30T23:24:32Z

Views

1281

def quicksort(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 quicksort(left) + mid + quicksort(right)


if __name__ == "__main__":
    print(quicksort([9, 3, 7, 1, 8, 2, 5]))