Data Structures from Basis to Advance Level using C

Explore recursion basics and advanced concepts, and trace recursive calls through a sample program while emphasizing the base condition and termination condition.

The lecture demonstrates tracing recursion using tree method with example 1, showing fun1 calling itself with n from 3 down to 0 and printing 3, 2, 1, a tail recursion.

Demonstrate a C program with a tail-recursive function that prints values in descending order and illustrates the main function, base case n > 0, and recursion.

Learn head recursion by tracing a recursive function, showing how each call invokes the next with n-1, then prints after returns, until the base case stops at zero.

Explore recursion in C by comparing tail and head recursion through a program that prints one, two, three after recursive calls; observe the returning phase and the base condition.

Explore the difference between loops and recursion, including the ascending (calling) and descending (returning) phases. Learn when loops are more space-efficient and when recursion is advantageous.

Explore how recursion uses the stack, including activation records, memory layout, and function calls, and learn to trace stack growth and output during the ascending phase.

Explore how recurrence relations model time and space complexity in algorithms. Solve t(n) with substitution to reveal linear time and the order of n for common structures.

Explore how static and global variables behave in recursion by tracing a sample function, including ascending and returning phases, activation records, and a memory layout that yields the result 15.

Explore static and global variables in recursion with a C example that sums from n to 1 using a recursive function, yielding 15 in this demonstration.

explains how static and global variables persist across recursion using an example, showing activation records and an output of 25.

Explore tree recursion, where a function calls itself more than once, unlike linear recursion. Analyze termination condition, multiple function calls, and the exponential time complexity 2^n with stack height n+1.

Explore indirect recursion by tracing mutual calls between functions a and b, printing values as they recurse, and comparing outcomes when starting from A 20 versus B 20.

Discover nested recursion, where a function calls itself with a function argument, and learn to trace cases like n>100 return n-10 and else return fun(n+11).

Learn to implement a recursive function for the sum of n natural numbers, with base case n equals zero and recursion as sum of n minus one plus n.

Explore the factorial of a number and how to implement a recursive function in C, including the base case n equals zero and examples like three, four, and five.

learn to compute m^n using a recursive function, with base case n=0, by multiplying m n times; see how this approach reduces calls from 9 to 5 in 2^9.

Explore the fibonacci series via recursion with base cases fib(n) ≤ 1 and recursive calls fib(n-2) and fib(n-1); memoization uses a global array initialized to -1 to reduce exponential time.