The Coder's Toolbox

Описание: #Algorithms: The primary focus of the material, emphasizing a practical understanding of tools for solving real-life problems over academically rigorous proofs
.
#AlgorithmEfficiency: A key measure of a good algorithm, noting that the size of the data matters when measuring performance
.
#TimeComplexity: Measured and compared using foundational mathematical techniques rather than relying purely on hardware parallelism
.
Mathematical Foundations
#Summations: Mathematical notations used to add up the terms of a finite sequence, which can be manipulated by splitting them or factoring out common linear constants
.
#ArithmeticSeries: A mathematical sequence where the difference between any two consecutive terms remains constant
.
#GeometricSeries: A sequence where the ratio between consecutive terms is constant. If the fractional rate is less than 1, the series converges to a constant
.
#HarmonicSeries: An infinite series formed by adding positive unit fractions. While it diverges, its growth rate is closely related to the natural logarithm function
.
#Integrals: Used to approximate summations by establishing lower and upper bounds for monotonically increasing or decreasing functions
.
Algorithm Proof Techniques
#MathematicalInduction: A technique used to prove that a property holds true for every natural number. It requires proving a "base case" (starting number) and an "induction step" (showing that if it holds for n, it holds for n+1)
.
#LoopInvariant: An extension of mathematical induction used to prove the correctness of a program loop. It is a logical assertion that remains true before and after each iteration of the loop
.
#BubbleSort: The sorting algorithm utilized in the text as a practical example to demonstrate how to write a Loop Invariant proof for both inner and outer loops
.
Logarithms and Probability
#Logarithms: The course strictly relies on base-2 logarithms (often denoted as lg n). A base-2 logarithm represents how many times a number must be divided by 2 to reach 1, which demonstrates that logarithmic time complexity grows very slowly
.
#AsymptoticExpression: Used with logarithms to express efficiency. The base of the logarithm is usually ignored in asymptotic notation because changing bases only alters the value by a constant factor
.
#Probability: Discrete random variables, uniform probability distributions, and the linearity of expectation, which are referenced as necessary background mathematics