Skip to content

0 0L1

💻

Tech & Future

Tech & Programming

Speak to machines, build things

I

Novice

Mastery0%

INovice

Basics Concepts

Language Basics Data Structures Workflow and Git Engineering Mindset(13)

Home
Review
Search
Stats
Map

No login, no tracking
Progress lives in your browser. No accounts, no analytics, no cookies for tracking.
Works offline once loaded
Static export with manifest. Install to home screen on phone or desktop.
FSRS spaced repetition
The same algorithm modern Anki uses. Cards resurface just before you forget.
Honest game loop
XP for real learning actions only. No FOMO push, no infinite scroll, no manipulative streaks.

A daily learning loop for real-world domains. Built on epistemic honesty and spaced repetition. No dark patterns.

Catalogue

Home
Skill Map
Search

Practice

Review
Dashboard
My List

App

About
Settings

Built with care, MIT licensed.v1.0·Accessibility statement·Education, not advice. Source

Concepts›Engineering Mindset›Big O complexity

Concept 14 of 21

settled

Big O complexity

How fast does the cost grow if the input doubles, triples, explodes?

Definition

Mathematical notation from Bachmann and Landau that describes how the runtime or memory of an algorithm grows as the input size grows toward infinity.

Step 1

Predict first

In one or two sentences, what do you think this concept means? Wrong is fine; the small struggle is what makes the answer stick.

Eventual consistency Distributed consensus