ALGORITHMS & COMPUTING HUB · COMPLETE INDEX
Complete Algorithms & Computing Index
Find an algorithm by name, choose a subject route, or compare overlapping guides by scope. Open a guide to trace the method, understand its assumptions and test what you can do independently.
About this index
This index brings together algorithms and computing learning guides. Use the subject routes when you need a starting point and the alphabetical list when you already know a method. The displayed result count describes the articles matched by this index, not the size of the whole eduKate library.
Boundary: this is the computing-learning catalogue within eduKate Sengkang. Science guides remain under the Science Hub, and learning-diagnosis and practice guides remain under the Learning Runtime Hub. Their related material can support a computing task without changing its learning route.
Choose a Corridor First
The map groups the field by learning job. The registry below is alphabetical so a reader who already knows a name can find it quickly.
Live Alphabetical Registry
This list is deliberately title-only. Open an article for its learning progression, evidence, implementation guidance, limits and professional context.
Index Policy
Use this index to find learning guides, not to treat computing as a finished checklist. The subject hub explains relationships; individual guides help you trace, reconstruct, implement, test and transfer a method. Related scientific and mathematical references remain connected to their own subject routes.
Overlapping Coverage — Choose by Scope
Both routes are preserved. Use the narrower article whose stated scope matches the problem; the pairing below prevents similar coverage from becoming invisible.
- B+ Tree coverage: B+ Tree Algorithms · B+ Trees for database-index engineering
- Bridson Poisson-disk sampling: Active lists, background grids and O(N) sampling · Blue noise, minimum-distance grids and fast sampling
- Delta-Stepping: Distance buckets and relaxation rounds · Parallel relaxation and throughput
- Exact Cover: Algorithm X, matrices and heuristics · Dancing Links and reversible backtracking
- Fast Marching Method: Accepted fronts and arrival-time computation · O(N log N) arrival-time computation
- Treaps: BST order and expected logarithmic time · Expected balance and sequence design
- Aho–Corasick: One-pass multi-pattern matching · Streaming multi-pattern search
- Gale–Shapley / stable matching: Deferred acceptance and market-design reasoning · Blocking pairs and proposer optimality
- Knuth optimisation: Interval recurrences and monotone split points · Quadrangle inequalities and O(n²) speedups
Search-Visible Algorithm Guides
Direct routes to algorithm guides currently receiving substantial search visibility.
Explore the wider eduKate Sengkang library
English Archive · Mathematics Archive · Science Archive · Examination Archive · Learning Runtime Archive · Algorithms & Computing Archive · Castle Registry · All Pages & Posts
