Subfield guideAlgorithmsComputer Science

Algorithms

This guide gives you the narrated version of Algorithms. Use it to get your bearings, learn the recurring terms, and avoid the common confusions before you switch into the interactive atlas.

Orientation cues4Signals about what to notice first in the field.
Key terms5Core vocabulary worth learning before exploring.
Common traps3Mistakes beginners make when they read the field too quickly.
Next reads3Books and papers to go deeper once you have the map.
Start here

Before You Dive In

These notes tell you what matters first so you do not hit the field as a flat list of names and terms.

  • Algorithms addresses a core algorithms question: what can we compute efficiently, and with what guarantees?
  • Rough timeline: classical design methods -> NP-completeness and intractability -> randomized and approximation methods -> streaming, online, and parameterized frameworks.
  • Start with reduction and complexity classes; they organize almost every advanced algorithmic argument.
  • In Noosaga, compare frameworks by objective: exactness, approximation ratio, memory footprint, latency, or communication cost.
Vocabulary

Key Terms to Know

Learn these first. They will show up again when you open the timeline, framework articles, and concept map.

ReductionTransforming one problem into another to transfer hardness or algorithmic results.
NP-completenessClass of problems believed to lack polynomial-time exact algorithms.
Approximation algorithmAlgorithm with provable closeness to optimal solution for hard problems.
Randomized algorithmAlgorithm using randomness to improve expected performance or simplicity.
Asymptotic analysisGrowth-rate analysis of runtime or space as input size increases.
Watch for this

Common Confusions

These are the mistakes that make the field look simpler, flatter, or more settled than it really is.

Equating asymptotically optimal with practically fastest on real workloads.
Assuming NP-hard means impossible; many instances remain solvable with structure-aware methods.
Treating proofs as optional; guarantees are the defining value of algorithmics.
Go deeper

Recommended Reading

Once the map makes sense, these are solid next reads for depth, historical grounding, or formal detail.

Introduction to AlgorithmsThomas H. Cormen et al.
2022
Algorithm DesignJon Kleinberg & Eva Tardos
2005
The Design of Approximation AlgorithmsDavid P. Williamson & David B. Shmoys
2011
Switch to explore

How to Use the Interactive View

The guide gives you the narrated pass. The interactive view is where you compare frameworks, read articles, and study one approach in depth.

1

Explore the timeline

Open the interactive view and scan the framework timeline. Which frameworks came first? Which ones overlap? Where are the big transitions?

2

Read the articles

Click into individual frameworks to read what each one claims, where it came from, and how it relates to its neighbors.

3

Check the concept map

See how the key ideas within a framework connect. This is useful for figuring out what to learn first and what depends on what.

4

Test yourself

Take the quiz for any framework you've read about. It's a quick way to find out whether you actually understood the core ideas or just skimmed them.

Ready to move from narration to the map?

Open the interactive atlas for Algorithms, scan the timeline first, then choose one framework to study.

Open interactive atlas
Keep going

Stay in the same neighborhood

Compare this guide with nearby subfields, or jump into the docs if you want help reading Noosaga's timelines and maps.

Approximation AlgorithmsDesign ParadigmsDistributed AlgorithmsAll Algorithms guidesHow to read timelines