9.1.1. Objectives¶

Upon completion of this module, students will be able to:

• Trace recursive methods

• Implement recursive methods

• Consider the efficiency of recursive methods

9.1.2. Introduction to Recursion¶

9.1.2.2. [12:41] Intro to Recursion Video, Part 2 of 2¶

Video Slides 9.1.2.2-RecursionIntro.pdf

9.1.3. Checkpoint 1¶

9.1.4. More Recursion¶

9.1.4.1. [12:36] Factorial Examples Video¶

Video Slides 9.1.3.1-RecursionExample.pdf

9.1.5. Programming Practice: Recursion 1¶

9.1.6. Recursion on Arrays¶

9.1.6.1. [13:30] Display Arrays Video¶

Correction to note! The code in the second example of this video is missing {} in the if block. It should be:

public static void displayArray2(int[] array, int first, int last)
{
     if (first <= last) {
         displayArray2(array, first, last - 1);
         System.out.print(array[last] + " ");
     }

}

Video Slides 9.1.5.1-DisplayArrays.pdf

9.1.7. Checkpoint 2¶

9.1.8. Recursion on Arrays Middle¶

9.1.8.1. [9:53] Middle Processing Trace Video¶

Video Slides 9.1.6.1-DisplayArraysMiddle.pdf

9.1.9. Checkpoint 3¶

9.1.10. Programming Practice: Recursion 2¶

9.1.11. Recursion on Linked Chain¶

9.1.11.1. [7:41] Linked Chain Recursive Video¶

Video Slides 9.1.8.1-DisplayBagsRecursively.pdf

9.1.12. Tower of Hanoi¶

9.1.12.1. [11:44] Tower of Hanoi Video¶

Video Slides 9.1.9.1-TowersOfHanoi.pdf

9.1.13. Checkpoint 4¶

9.1.14. Recursion Wrap Up¶

9.1.14.1. [8:28] Recursion Wrap Up Video¶

Video Slides 9.1.10.1-RecursionWrapUp.pdf

9.1.15. Programming Practice: Recursion 3¶

9.1.16. Forward Flow Tracing Exercises¶

9.1.17. Backward Flow Tracing Exercises¶

9.1.18. Find Error Tracing Exercises¶

9.1.19. Two Recursive Calls Tracing Exercises¶

9.1.20. How Many Times Tracing Exercises¶

9.1.21. Harder Tracing Exercises¶