Recursion

Data Structures & Problem SolvingUsing JAVASecond Edition

Mark Allen Weiss

Chapter 7

© 2002 Addison Wesley

Figure 7.5A stack of activation records

Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

Figure 7.7A trace of the recursive calculation of the Fibonacci numbers

Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

Figure 7.8A tree viewed recursively

Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

Figure 7.9A tree

Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

Figure 7.12A recursively drawn ruler

Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

Figure 7.14(a) A fractal star outline drawn by the code shown in Figure 7.15 (b) The same star immediately before the last square is added

Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

Figure 7.19Dividing the maximum contiguous subsequence problem into halves

Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

Figure 7.21Trace of recursive calls for recursive maximum contiguous subsequence sum algorithm for N = 8 elements

Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

Figure 7.22Some of the subproblems solved recursively in Figure 7.23

Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

Figure 7.24An alternative recursive algorithm for the coin-changing problem

Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley

Figure 7.30Grid for Exercise 7.31

Data Structures & Problem Solving using JAVA/2E Mark Allen Weiss © 2002 Addison Wesley