Vocabulary

Understand the term. Connect the concept.

A practical dictionary of 512 AI, machine learning, mathematics, and programming terms from HerbDev’s AI Vocabulary app. Start with a definition, explore an example, then follow the concepts behind it.

Linked concepts open in a new tab. Audio reads the definition and example.

Big-O Notation

Algorithms · Level 2 of 5

Big-O Notation

An asymptotic upper-bound notation for growth rates.

A loose upper bound need not describe exact or typical runtime.

Example

An algorithm's work is bounded by a constant multiple of n squared for large n.

Listen to the definition and example

Audio transcript

Big-O Notation. An asymptotic upper-bound notation for growth rates. A loose upper bound need not describe exact or typical runtime. For example: An algorithm's work is bounded by a constant multiple of n squared for large n.

Explore this concept

Why it matters

This helps you compare problem-solving methods and their computational tradeoffs.

Start with

Time Complexity

Related concepts

Quick recall question

Try answering before looking back at the definition.

Put the terminology into context: How AI works · Machine-native representations · All learning paths

Manage browser learning data

“Remove my test data” clears all AI 101 and ML 101 scores, reviews, project checklists and rating selections, plus saved vocabulary and recent history in this browser. Test entries cannot be separated from other learning progress. Cookie preferences, security protections, submitted feedback, contact emails and past analytics are kept.