Tag: lower bounds

• Sorting Algorithms: Bubble Sort, Merge Sort, Quicksort and the Quadratic WallWhy bubble sort is quadratic, explained through inversions; a proof that the divide-and-conquer structure of merge sort achieves n log n; and how the gap between quicksort's average and worst case grows out of the choice of pivot.Computer ScienceAlgorithms and Data StructuresUndergraduatesortingdivide and conquercomplexityquicksortlower bounds~22 min