Tag: complexity

• Complexity and Big-O Notation: Measuring Speed as a Function of Input SizeDefines time and space complexity from a machine model, states O, Ω and Θ as sets of functions, proves the growth hierarchy, and compares classes from O(1) to O(2^n) numerically.Computer ScienceAlgorithms and Data StructuresUndergraduatecomplexitybig-O notationasymptotic analysismaster theorempolynomial time~24 min
• 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