Category: Blog
-
How to Learn Knuth DP Optimization: Interval Recurrences, Monotone Split Points and Quadrangle Inequalities
A Learning Hall guide to Knuth optimization: recognise the interval-DP recurrence, prove monotone optimal split points, understand quadrangle inequalities, and reduce cubic dynamic programming to quadratic time safely.
-
How to Learn Convex Hull Algorithms: Orientation Tests, Graham Scan, Monotone Chain and Robust Geometry
A Learning Hall guide to convex hulls: master orientation tests, trace Graham scan and monotone chain, handle collinearity, and understand why robust predicates matter in real computational geometry.
-
How to Learn Eppstein’s K-Shortest-Paths Algorithm: Shortest-Path Trees, Sidetrack Costs, Persistent Heaps and Path Enumeration
A beginner-to-professional guide to Eppstein’s k-shortest-paths algorithm, covering shortest-path trees, sidetrack penalties, persistent heaps, output-sensitive enumeration and the simple-versus-non-simple path distinction.
-
How to Learn Patricia Tries and Radix Trees: Path Compression, Bitwise Branching and Longest-Prefix Search
A Learning Hall guide to Patricia tries and radix trees: understand path compression, distinguishing bits, compressed branching, longest-prefix search and the space–time trade-offs behind prefix indexes.
-
How to Learn Radix Heaps: Monotone Keys, Bit Buckets, Redistribution and Integer-Weight Dijkstra
A beginner-to-professional guide to radix heaps, covering monotone integer keys, bit buckets, redistribution, amortised analysis, Dijkstra integration, testing and performance engineering.
-
How to Learn Myers’ Diff Algorithm: Edit Graphs, D-Paths, Shortest Edit Scripts and Linear-Space Reconstruction
A beginner-to-professional guide to Myers’ diff algorithm, covering edit graphs, furthest-reaching D-paths, shortest edit scripts, LCS, linear-space reconstruction, Git practice and robust testing.
