Chapter 7. Chapter 8.

Chapter 7.
FIGURE 7.1 Polya’s How to Solve It list
George Polya
FIGURE 7.2 The computer problem-solving process
FIGURE 7.3 The interactions among the four problem-solving phases
loop control variable
algorithm
posCount
FIGURE 7.4 Walk-through of the square root algorithm
FIGURE 7.5 An array of ten numbers
FIGURE 7.6 Record Employee

FIGURE 7.7 An unsorted array
FIGURE 7.8 A sorted array
TABLE 7.1
FIGURE 7.10 Trace of the binary search
FIGURE 7.11 Examples of selection sort (sorted elements are shaded)
FIGURE 7.12 Examples of a bubble sort
FIGURE 7.13 Insertion sort
FIGURE 7.14 Subprogram flow ofcontrol
FIGURE 7.15 Ordering a list using the Quicksort algorithm
Quicksort(first, last)
index (splitPoint)
FIGURE 7.16 Splitting algorithm
FIGURE 7.17 Different views of the same concept
Exercises 63–65 use the following array of values.
Exercises 66 and 67 use the following array of values.

Chapter 8.
FIGURE 8.1 An unsorted list of integers
FIGURE 8.2 An unsorted linked list
FIGURE 8.3 A sorted list of integers
FIGURE 8.4 A sorted linked list
FIGURE 8.5 An animal hierarchy forms a tree
FIGURE 8.6 A binary tree
Courtesy of the U.S. Department of Energy
FIGURE 8.7 A binary search tree
FIGURE 8.8 Two variations of a binary search tree
tree
FIGURE 8.9 A binary search tree built from strings
TABLE 8.1
TABLE 8.2
algorithm
FIGURE 8.10 Examples of graphs
TABLE 8.3
FIGURE 8.11 Using a stack to store the routes
FIGURE 8.12 The depth-firstsearch
FIGURE 8.13 Using a queue to store the routes
FIGURE 8.14 The breadth-firstsearch
paths
list
FIGURE 8.15 The difference between value parameters and reference parameters
binary search tree
Exercises 51–55
Exercises 56–60