Sign in to confirm you’re not a bot
This helps protect our community. Learn more

COMP1511 - Programming Fundamentals Week 9 - Lecture 16

0:29

What did we learn last lecture? Abstract Data Types • An extension/explanation of the use of Multiple File Projects • Presenting an idea. A structure with a set of rules . But hiding the implementation • A Stack as an example

4:13

What are we covering today? Recursion • An interesting inversion on the order of program execution • Functions that call themselves . Using the program call stack to determine the order of operations

5:48
Lecture 16, COMP1511 - Programming Fundamentals 2020 Term 3
Lecture 16 - Recursion This lecture we're going to look at a very interesting, inverted way of thinking about programming. If functions can call themselves, what can they now do differently and what interesting techniques can we build from this?

COMP1511 - Programming Fundamentals Week 9 - Lecture 16

0:29

What did we learn last lecture? Abstract Data Types • An extension/explanation of the use of Multiple File Projects • Presenting an idea. A structure with a set of rules . But hiding the implementation • A Stack as an example

4:13

What are we covering today? Recursion • An interesting inversion on the order of program execution • Functions that call themselves . Using the program call stack to determine the order of operations

5:48

Follow along using the transcript.

Marc Chee

1.61K subscribers