#divide-and-conquer

Sorting II: Merge Sort & Quicksort

Divide and conquer sorting: merge sort's stable O(n log n) and quicksort's partitioning, average O(n log n) and worst O(n²), with a live visualizer and runnable Python.