Links across modules.
Write "recursion" in Algorithms and Tallbook shows where you met it in C++ last term.
recursion
- AlgorithmsWeek 6 · this term
- C++Week 9 · last term
Tallbook turns what you write in lectures into revision cards, and links each idea to where it came up before.
Free for three notebooks. No card needed.
Plain text, headings and quick lists. No templates to fill in.
Each heading and each definition becomes a card with the question on the front.
Cards come back the day before you'd forget them, not all at once in exam week.
Week 6 · Algorithms
Recursion
A function that calls itself on a smaller version of the problem.
Needs a base case, or it never stops.
Base case
The input small enough to answer directly.
Three cards from five lines. You wrote nothing extra.
Write "recursion" in Algorithms and Tallbook shows where you met it in C++ last term.
recursion
Notes save on your laptop first and sync when the Wi-Fi comes back.
Type a list of steps and get a flowchart you can drag into place.
Pick a date and Tallbook only shows the cards you need before it.
£0
Three notebooks, revision cards, works offline.
Start a notebook£3 a month
Unlimited notebooks, diagrams, exam mode, sync across your devices.
Try Student free for 14 daysCancel any time from settings. Your notes stay yours and export as plain text.
No. Write the way you already do. Headings and "X is Y" sentences make the best cards.
Yes. Paste them in or import Markdown and Word files, and Tallbook makes cards from those too.
You keep all of them. You go back to three active notebooks, and the rest become read-only.
Yes, with LaTeX in notes and on cards.