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.

Recursive Function

Functions & Programming Concepts · Level 2 of 5

Recursive Function

A function defined using calls to itself, directly or indirectly.

A base case or other termination argument is needed to avoid unbounded recursion.

Example

A factorial routine reduces its argument until reaching one.

Listen to the definition and example

Audio transcript

Recursive Function. A function defined using calls to itself, directly or indirectly. A base case or other termination argument is needed to avoid unbounded recursion. For example: A factorial routine reduces its argument until reaching one.

Explore this concept

Why it matters

This helps you distinguish a computation’s contract, inputs, outputs, and behavior.

Start with

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.