Flashcard: Mastering Recursive Algorithms — 18 carte

Recursivity — definition?

Self-reference in processes or objects.

Recursive process — role?

Involves a function calling itself during execution.

Recursive object — function?

An object containing or defined by itself.

Examples of recursive phenomena?

Stories within stories, nested structures.

Recursive concept — key point?

Self-reference creates self-similar structures.

Recursive definitions — include?

Base cases and recursive case reduction.

Base cases — purpose?

Stop recursion, provide explicit solutions.

Recursive case reduction — process?

Simplifies problem towards base case.

Recursive algorithms — types?

Direct and indirect recursion.

Direct recursion — occurs when?

Function calls itself explicitly.

Simple recursion — example?

Power function $x^n$ with one self-call.

Multiple recursion — involves?

More than one recursive call in a function.

Indirect recursion — cycle?

Functions call each other in a chain.

Example of indirect recursion?

Even and odd number functions calling each other.

Recursion functioning — environment?

Each call creates a new environment in the call stack.

Recursion depth — definition?

Number of active nested calls during execution.

Base cases — importance?

Ensure recursion terminates with known solutions.

Recursive case reduction — purpose?

Progresses problem towards base case.