Recursion from scratch

Learn to visualize recursion by hand with copy and pen or an online tool, tracing a function call from 10 to 11 to 13 and the stack-based returns.

visualize factorial and fibonacci through recursion with a c++ example, tracing recursive calls from base cases to final results and mastering the recurrence relation.

This lecture explains the greatest common divisor using the euclidean algorithm, showing how to reduce two numbers with modulo to find gcd, using examples like 81 and 72.

Explore a simple recursive copy function that transfers characters from string one to string two using an index, with base cases and recursive calls to copy all characters.

Explores recursion from scratch by tracing a function's calls, parameters, and bottom values, illustrating how executing in reverse order and repeated calls affect outcomes.

learn the recursive power function from scratch, with a clear base case and a two-part breakdown using the same function with different parameters, plus summation and modulo examples.

Explore how to determine prime numbers using a recursive brute-force approach that checks divisibility from 2 up to the square root of n, returning true if no divisor exists.

Explore counting vowels in a string with a recursive function, using a two-parameter string and size, checking the last character, then recursing. Compare a substring approach and its time complexity.

This lecture shows how recursion computes a square by reducing the problem to smaller inputs, highlighting the base case and the stepwise breakdown into subproblems.

Explore how to locate the first occurrence of a target number in an array using a recursive approach, returning the index or -1 if absent.

Explain Pascal's triangle and its binomial coefficients, with edges as one and inner values as sums from above. Show how to compute nCr recursively, including a dynamic vector approach.

Explore converting a decimal number to binary using recursion by dividing by two, taking remainders, and building the binary string until reaching the base case.

Learn to remove all duplicates from a string using a recursive approach, including base-case handling for empty or single-character strings and step-by-step sample inputs to clarify expected outputs.

Explore recursive techniques to remove duplicates from strings, clarifying single versus multiple duplicates and base cases. Optimize with start and end indices to avoid substring calls and analyze time complexity.

Learn to recursively merge two sorted strings into lexicographic order by defining a two-input function, handling empty cases, and comparing characters via ASCII values before recursing.

Explore recursion through practical problems, including inserting values into a binary search tree, computing string length, summing digits, and checking palindromes with index-based recursion.

Explore modular exponentiation recursion and divide-and-conquer strategies to handle even and odd exponents while preventing overflow and understanding log-time complexity.

Count all occurrences of a target character in a string using recursion, with a base case and a step that adds when the first character matches, avoiding substrings via indices.

Explore the classic recursive balance parentheses problem, using a stack-like crawl and a single balance counter to validate strings, with practical assignments on graphs, stacks, topological sort, and zeroing negatives.