Category: Blog
-
How to Learn Smoothsort: Leonardo Heaps, Adaptive In-Place Sorting, Heap Forests and Nearly Sorted Data
A Learning Hall guide to smoothsort from heapsort and Leonardo numbers through heap forests, adaptivity, invariants, implementation difficulty and professional sorting trade-offs.
-
How to Learn the Möller–Trumbore Algorithm: Ray–Triangle Intersection, Barycentric Coordinates, Determinants and Robust 3D Geometry
A Learning Hall guide to Möller–Trumbore from ray equations and barycentric coordinates through determinant tests, numerical robustness, BVH context and professional geometry practice.
-
How to Learn Havel–Hakimi: Degree Sequences, Graphicality, Greedy Realisation and Constructive Graph Theory
A Learning Hall guide to Havel–Hakimi from degree sequences and graphicality through greedy reduction, graph construction, proof ideas, Erdős–Gallai comparison and implementation boundaries.
-
How to Learn Tarjan’s Offline LCA Algorithm: DFS, Union–Find, Ancestor Labels and Batched Tree Queries
A Learning Hall guide to Tarjan’s offline lowest-common-ancestor algorithm from rooted trees and DFS through union–find, ancestor labels, batched queries, invariants and workload trade-offs.
-
Sethi–Ullman Algorithm | Register Allocation Learning Guide
A Learning Hall guide to the Sethi–Ullman algorithm from expression trees and Ershov numbers through evaluation order, register pressure, spill minimisation and compiler-model boundaries.
-
How to Learn Floyd–Rivest Selection: Sampling, Bracketing, Partitioning and Near-Optimal Expected Comparisons
A Learning Hall guide to Floyd–Rivest selection from order statistics and Quickselect through sampling, bracketing, partitioning, expected comparison bounds and production safeguards.
