data abstraction and problem solving with c++ walls and mirrors, third edition, frank m. carrano and...

Data Abstraction and Problem Solving with C++ Walls and Mirrors, Third Edition, Frank M. Carrano and Janet J. Prichard ©2002 Addison Wesley

CHAPTER 2Recursion: The Mirrors

DATA ABSTRACTION AND PROBLEM SOLVING WITH C++

WALLS AND MIRRORSThird Edition

Frank M. CarranoJanet J. Prichard



Figure 2-1A recursive solution


Figure 2-2fact(3)


Figure 2-3A box


Figure 2-4The beginning of the box method


Figure 2-5aBox trace of fact(3)


Figure 2-5bBox trace of fact(3)


Figure 2-5cBox trace of fact(3)


Figure 2-6A recursive solution


Figure 2-7aBox trace of writeBackward("cat", 3)


Figure 2-7bBox trace of writeBackward("cat", 3)


Figure 2-7cBox trace of writeBackward("cat", 3)


Figure 2-8aBox trace of writeBackward("cat", 3) in pseudocode


Figure 2-8bBox trace of writeBackward("cat", 3) in pseudocode


Figure 2-8cBox trace of writeBackward("cat", 3) in pseudocode


Figure 2-8dBox trace of writeBackward("cat", 3) in pseudocode


Figure 2-8eBox trace of writeBackward("cat", 3) in pseudocode


Figure 2-8fBox trace of writeBackward("cat", 3) in pseudocode


Figure 2-9aBox trace of writeBackward("cat", 3) in pseudocode


Figure 2-9bBox trace of writeBackward("cat", 3) in pseudocode


Figure 2-9cBox trace of writeBackward("cat", 3) in pseudocode


Figure 2-9dBox trace of writeBackward("cat", 3) in pseudocode


Figure 2-9eBox trace of writeBackward("cat", 3) in pseudocode


Figure 2-10Recursive solution to the rabbit problem


Figure 2-11The recursive calls that rabbit(7) generates


Figure 2-12The recursive calls that c(4, 2) generates


Figure 2-13Recursive solution to the largest-item problem


Figure 2-14The recursive calls that maxArray(<1,6,8,3>) generates


Figure 2-15aBox traces of binarySearch with anArray = <1, 5, 9, 12, 15, 21, 29, 31>:(a) a successful search for 9


Figure 2-15bBox traces of binarySearch with anArray = <1, 5, 9, 12, 15, 21, 29, 31>: (b) an unsuccessful search for 6


Figure 2-16Box method with a reference argument


Figure 2-17A sample array


Figure 2-18A partition about a pivot


Figure 2-19a and 2-19b(a) The initial state; (b) move n – 1 disks from A to C


Figure 2-19c and 2-19d(c) move one disk from A to B; (d) move n – 1 disks from C to B


Figure 2-20The order of recursive calls that results from solveTowers(3, A, B, C)


Figure 2-21aBox trace of solveTowers(3,'A', 'B', 'C')


Figure 2-21bBox trace of solveTowers(3,'A', 'B', 'C')


Figure 2-21cBox trace of solveTowers(3,'A', 'B', 'C')


Figure 2-21dBox trace of solveTowers(3,'A', 'B', 'C')


Figure 2-21eBox trace of solveTowers(3,'A', 'B', 'C')


Figure 2-21fBox trace of solveTowers(3,'A', 'B', 'C')

data abstraction and problem solving with c++ walls and mirrors, third edition, frank m. carrano and...

Documents

c walls

mirrors data abstraction

prichard data abstraction

edition frank

carrano janet

addison wesley slide

addison wesley figure

box slide