eduKate Sengkang · LEARNING HALL · ALGORITHMS & COMPUTING
Algorithms Are Ways of Making Decisions Precise Enough to Run
New to computing? Begin with the Algorithms Learning Roadmap. Use the subject routes below when you know which method you want to explore.
Start with the problem. Name the state. Protect the invariant. Count the cost. Test the failure cases. Then decide whether the method still works when the data, machine, network or world becomes difficult.
Problem → representation → rule → invariant → cost → test → implementation → world return.
Choose your starting point. Use this hub to learn an algorithm by tracing examples, explaining why it works, implementing it, testing it and trying it on a different problem. Begin with the Algorithms Learning Roadmap when you need a learning sequence. For a view of the discipline, read What Is Computer Science? or explore the Engineering, Computing and Technology Library. To connect the method to scientific inquiry, engineering design and mathematical reasoning, read How Computing Fits Into STEM.
How to Use This Hub
1. Learn to Trace
Follow a small example by hand. Record every change of state. Predict the next move before revealing it.
2. Learn the Invariant
Identify what must remain true while the algorithm moves. That is usually where correctness lives.
3. Learn the Cost Model
Time, memory, communication, numerical error and implementation complexity are different costs. State which one matters.
4. Test the Boundary
Try empty input, repeated values, adversarial order, overflow, disconnection, concurrency, noise and scale.
Ten Permanent Computing Corridors
Use the corridors to choose a learning route. Use the Complete Index when you already know the method, structure or system you need.
1. Foundations, Correctness & Complexity
Learn how an algorithm is represented, justified, measured and tested before specialising.
2. Data Structures, Search & Indexing
Choose how information should be stored so the operations that matter remain possible and affordable.
3. Graphs, Networks, Flows & Routing
Model relationships, paths, dependencies, connectivity, assignment and movement through networks.
4. Strings, Parsing & Language Processing
Search text, represent repeated structure, recognise languages and turn symbol streams into meaning.
5. Dynamic Programming, Combinatorics & Exact Search
Break hard problems into states, exploit overlap, prune impossible routes and know when exponential work remains unavoidable.
6. Numerical Methods, Optimisation & Scientific Computing
Compute useful approximations while keeping conditioning, convergence, stability and error visible.
7. Geometry, Graphics, Imaging & Spatial Computation
Turn coordinates, shapes, pixels, surfaces and spatial relationships into robust computational decisions.
8. Probability, Randomisation, Streaming & Sketches
Use limited memory, sampled evidence and controlled probability without confusing an estimate with certainty.
9. Systems, Databases, Concurrency & Distributed Computing
Reason about work shared across processors, storage engines, networks and failure-prone machines.
10. AI, Machine Learning, Games & Decision Systems
Build systems that estimate, rank, learn, search or decide while keeping objectives, evidence and failure modes explicit.
The Complete Registry
The ten corridors are the learning map. The Complete Algorithms & Computing Index is the live orphan-control layer; the rendered result count is authoritative and updates with WordPress ownership.
Continue with the Question You Have Now
Keep the computational task and the subject it represents distinct. Use these algorithm lessons to trace procedures, justify choices, implement methods and test their limits. When a model depends on biology, physics or another scientific explanation, use Science World for the underlying science. For practice explaining and applying those ideas, use the Science Learning Hub.
If you can follow an example but cannot reconstruct the method, choose it on a new task or find your own error, use the Learning Runtime Hub to identify what needs attention. Then return to the Algorithms Learning Roadmap and try a fresh example without copying the worked solution.
Algorithms and computing are one room in a larger Learning Hall. When you need the wider map, return to Learning Hall.
High-Impression Algorithm Guides
These guides are already being discovered through search and deserve direct routes from the Algorithms & Computing Hub.
STEM bridge: this hub owns the algorithms-and-computing route. For the explicit handoffs between algorithms, software, data, AI, Mathematics, Engineering, Science and deployed Technology, continue to How Computing Fits Into STEM, then return to the STEM Hub.
Technical routing notes
Castle machine route: Algorithms & Computing is the domain junction for /learning-castle/0017 Engineers’ Quarter / Armoury. Learner roadmap: Algorithms Learning Roadmap. Archive: Complete Algorithms & Computing Index. AI and machine readers should load the Learning Castle Boot Protocol and Castle Registry. Canonical return: /learning-castle/0019.
