Category: Blog
-
Treap Algorithms | Split, Merge & Randomized BST Learning Guide
Learn treaps from first principles: preserve binary-search order and heap priority, trace rotations and split–merge operations, prove expected logarithmic behaviour, and judge when randomized balancing is appropriate.
-
How to Learn Reservoir Sampling: One-Pass Random Selection, Unknown Stream Length and Uniform Guarantees
A Learning Hall guide to reservoir sampling: select a uniform random sample from a stream in one pass, understand replacement probabilities, prove inclusion guarantees and evaluate streaming trade-offs.
-
How to Learn Simulated Annealing: Temperature, Acceptance Probability, Cooling Schedules and Search Trade-Offs
A Learning Hall guide to simulated annealing: understand temperature, probabilistic uphill moves, cooling schedules, neighbourhood design and how stochastic search balances exploration against exploitation.
-
How to Learn Skip Lists: Probabilistic Levels, Search Paths, Expected Cost and Concurrent Design
A Learning Hall guide to skip lists: probabilistic balancing, search paths, insertion, deletion, expected logarithmic cost and the engineering trade-offs behind this elegant ordered structure.
-
How to Learn Splay Trees: Self-Adjustment, Rotations, Amortized Analysis and Access Locality
A Learning Hall guide to splay trees: understand zig, zig-zig and zig-zag rotations, why frequently accessed items migrate upward, and how amortized analysis explains performance across sequences rather than single operations.
-
How to Learn Network Routing Algorithms: Distance Vector, Link State, Path Vector, ECMP and Segment Routing
A beginner-to-professional Learning Hall guide to network routing algorithms: distance vector, link state, OSPF, path vector, BGP policy, ECMP, convergence, fast reroute and segment routing.
