Category: Blog
-
How to Learn the Shunting Yard Algorithm: Tokens, Operator Stacks, Precedence, Associativity and Expression Parsing
A beginner-to-professional guide to Dijkstra’s shunting yard algorithm covering tokenisation, operator stacks, precedence, associativity, parentheses, functions, unary operators, ASTs, testing and production parser design.
-
How to Learn Aho–Corasick: Tries, Failure Links, Output Links and One-Pass Multi-Pattern String Matching
A beginner-to-professional guide to Aho–Corasick covering tries, failure links, output links, BFS construction, streaming multi-pattern search, complexity, Unicode, testing and production trade-offs.
-
How to Learn Otsu’s Thresholding Algorithm: Histograms, Within-Class Variance, Between-Class Separation and Robust Image Segmentation
A beginner-to-professional guide to Otsu’s thresholding algorithm, covering histograms, class probabilities and means, variance criteria, efficient implementation, failure modes, Multi-Otsu, validation and teaching progression.
-
How to Learn Prüfer Sequences: Leaf Removal, Tree Codes, Decoding, Degree Counts and Cayley’s Formula
A beginner-to-professional guide to Prüfer sequences, covering leaf-removal encoding, decoding, degree counts, Cayley’s formula, efficient implementations, random labelled trees and validation.
-
How to Learn Maximum Cardinality Search: Vertex Labels, Perfect Elimination Orderings, Chordal Graph Recognition and Linear-Time Structure
A beginner-to-professional guide to Maximum Cardinality Search, covering vertex labels, chordal graphs, perfect elimination orderings, linear-time bucket implementations, recognition, validation and teaching progression.
-
How to Learn Brandes’ Algorithm: Shortest-Path DAGs, Path Counts, Dependency Accumulation and Betweenness Centrality
A beginner-to-professional guide to Brandes’ algorithm for betweenness centrality, covering shortest-path DAGs, path counts, dependency accumulation, weighted graphs, approximation, validation and teaching progression.
