Quick Sort
Partitions around a pivot, then recurses on each side.Unstable sortBestO(n log n)AverageO(n log n)WorstO(n²)0 compscomps0 swaps
0%
Bubble Sort
Repeatedly swaps adjacent out-of-order pairs until none remain.Stable sortBestO(n)AverageO(n²)WorstO(n²)0 comps0 swaps
Quick Sort
Partitions around a pivot, then recurses on each side.Unstable sortBestO(n log n)AverageO(n log n)WorstO(n²)0 comps0 swaps
0%
def quick_sort(arr, lo=0, hi=None): if hi is None: hi = len(arr) - 1 if lo >= hi: return arr p = partition(arr, lo, hi) quick_sort(arr, lo, p - 1) quick_sort(arr, p + 1, hi) return arrdef partition(arr, lo, hi): pivot = arr[hi] i = lo - 1 for j in range(lo, hi): if arr[j] < pivot: i += 1 arr[i], arr[j] = arr[j], arr[i] arr[i + 1], arr[hi] = arr[hi], arr[i + 1] return i + 1