Recursive Functions
Duration: 7 min
This video lesson is available to enrolled students.
AI Summary
An AI-generated summary of this video lecture.
The video lecture analyzes a recursive pseudo-code function named `Print_array(a, i, j)` to determine its output. The instructor begins by defining the function's logic: a base case where `i == j` prints the current element and returns, and a recursive step that calls the function with `i+1` before printing the current element `a[i]`. He sets up a concrete example using an array `a` with indices 0 through 4, populating it with values 10, 12, 18, 22, and 11. The specific function call analyzed is `print_array(a, 0, 3)`. Through a detailed trace on the whiteboard, the instructor demonstrates how the recursion unwinds, resulting in the array elements being printed in reverse order of their indices within the specified range.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the problem by displaying the pseudo-code for `void Print_array(a, i, j)`. He draws a diagram of an array `a` with indices 0 to 4. Initially, he writes memory addresses like 1000, 1004, 1008, 1012, 1016 above the array cells, but then corrects this to actual integer values: 10, 12, 18, 22, 11. He writes the initial function call `print_array(a, 0, 3)` on the board, setting the stage for the trace where `i` starts at 0 and `j` is 3.
2:00 – 5:00 02:00-05:00
The instructor traces the recursive execution step-by-step. He writes down the sequence of calls: `print_array(a, 0, 3)` calls `print_array(a, 1, 3)`, which calls `print_array(a, 2, 3)`, which finally calls `print_array(a, 3, 3)`. At this point, the condition `i == j` (3 == 3) is true. He circles the base case logic, noting that `a[3]` (value 22) is printed first. He then explains the return process, showing that after the recursive call returns, the code proceeds to the `printf` statement below it. This causes `a[2]` (18) to be printed, followed by `a[1]` (12), and finally `a[0]` (10) as the stack unwinds back to the initial call.
5:00 – 6:40 05:00-06:40
In the final segment, the instructor consolidates the results of the trace. He writes the final output sequence `22 18 12 10` at the bottom of the whiteboard. He emphasizes that the placement of the `printf` statement *after* the recursive call is the key factor causing the reverse order output. He circles the relevant lines of code to reinforce that the printing happens on the way back up the recursion stack, effectively reversing the order of indices from 0 to 3.
The lecture effectively demonstrates the concept of post-order traversal in recursion. By placing the print statement after the recursive call, the function delays printing until the base case is reached and the stack begins to unwind. This results in the output sequence being the reverse of the index progression from `i` to `j`. The instructor uses a concrete array example to visualize the stack depth and the specific values printed at each return step.