PDS - Recursion

Flashcards covering key concepts and definitions related to recursion and data structures.

Recursion

A process in which a function calls itself.

Base Case

A condition in a recursive function that stops the recursion when reached.

Recursive Function

A function that defines its own process in terms of itself.

Factorial

The product of all positive integers less than or equal to a given number n, denoted by n!.

GCD (Greatest Common Divisor)

The largest number that divides two integers with no remainder.

Fibonacci Sequence

A sequence where each number is the sum of the two preceding ones, usually starting with 0 and 1.

Dynamic Programming

An algorithmic paradigm that breaks problems into subproblems and stores the results to optimize efficiency.

Memoization

A technique for improving performance by storing the results of expensive function calls.

Tabulation

A bottom-up approach in dynamic programming that builds a table to solve problems.

QuickSort

A sorting algorithm that uses recursion to divide arrays into smaller sections to be sorted.