Fast Fourier Transform (FFT)
A radix-2 FFT guide: DFT normalization, butterfly decomposition, polynomial convolution, and the limits of floating-point integer results.
Subjects
Computer science
Reviewed articles explicitly assigned to Computer science. Only articles published in English appear here.
Floyd-Warshall Algorithm
Derive Floyd–Warshall’s all-pairs recurrence, implement it safely in C++, and interpret unreachable pairs and negative cycles.
Max-flow min-cut theorem
A proof of the max-flow min-cut theorem using residual reachability, with a concrete flow-and-cut certificate.
The Euclidean Algorithm: Computing a Greatest Common Divisor
A proof and worked trace of the Euclidean algorithm, including its nonnegative-input C++ implementation and logarithmic step count.
Flow network
Learn feasible flows, residual forward and reverse arcs, augmenting paths, cut bounds, and when Ford–Fulkerson terminates.
Graph theory. Strongly Connected Components (SCCs)
Understand strongly connected components and Tarjan’s index, low-link, and active-stack invariants, with a worked graph and implementation.
Radix Sort
A stable least-significant-digit radix sort for nonnegative safe integers, with input validation, complexity, and edge-case behavior.