Data Structures Using C++ 2E

Chapter 6
Recursion
 Objectives

• Learn about recursive definitions

• Explore the base case and the general case of a
recursive definition
• Learn about recursive algorithm
• Learn about recursive functions
• Explore how to use recursive functions to implement
recursive

Data Structures Using C++ 2E 2

 Recursive Definitions
• Recursion
– Process of solving a problem by reducing it to smaller
versions of itself
• Example: factorial problem
– 5!
• 5 x 4 x 3 x 2 x 1 =120
– If n is a nonnegative
• Factorial of n (n!) defined as follows:

Data Structures Using C++ 2E 3

 Recursive Definitions (cont’d.)
• Direct solution (Equation 6-1)
– Right side of the equation contains no factorial notation
• Recursive definition
– A definition in which something is defined in terms of a
smaller version of itself
• Base case (Equation 6-1)
– Case for which the solution is obtained directly
• General case (Equation 6-2)
– Case for which the solution is obtained indirectly using
recursion

Data Structures Using C++ 2E 4

 Recursive Definitions (cont’d.)

• Recursion insight gained from factorial problem

– Every recursive definition must have one (or more)
base cases
– General case must eventually reduce to a base case
– Base case stops recursion
• Recursive algorithm
– Finds problem solution by reducing problem to
smaller versions of itself
• Recursive function
– Function that calls itself
Data Structures Using C++ 2E 5
 Recursive Definitions (cont’d.)

• Recursive function implementing the factorial

function

FIGURE 6-1 Execution of fact(4)

Data Structures Using C++ 2E 6
 Recursive Definitions (cont’d.)

• Recursive function notable comments

– Recursive function has unlimited number of copies of
itself (logically)
– Every call to a recursive function has its own
• Code, set of parameters, local variables
– After completing a particular recursive call
• Control goes back to calling environment (previous call)
• Current (recursive) call must execute completely before
control goes back to the previous call
• Execution in previous call begins from point
immediately following the recursive call
Data Structures Using C++ 2E 7
 Recursive Definitions (cont’d.)
• Direct and indirect recursion
– Directly recursive function
• Calls itself
– Indirectly recursive function
• Calls another function, eventually results in original
function call
• Requires same analysis as direct recursion
• Base cases must be identified, appropriate solutions to
them provided
• Tracing can be tedious
– Tail recursive function
• Last statement executed: the recursive call
Data Structures Using C++ 2E 8
 Recursive Definitions (cont’d.)

• Infinite recursion
– Occurs if every recursive call results in another
recursive call
– Executes forever (in theory)
– Call requirements for recursive functions
• System memory for local variables and formal
parameters
• Saving information for transfer back to right caller
– Finite system memory leads to
• Execution until system runs out of memory
• Abnormal termination of infinite recursive function
Data Structures Using C++ 2E 9
 Recursive Definitions (cont’d.)

• Requirements to design a recursive function

– Understand problem requirements
– Determine limiting conditions
– Identify base cases, providing direct solution to each
base case
– Identify general cases, providing solution to each
general case in terms of smaller versions of itself

Data Structures Using C++ 2E 10

 Fibonacci Number

• Sequence: 1, 1, 2, 3, 5, 8, 13, 21, 34 . . .

• Given first two numbers (a1 and a2)
– nth number an, n >= 3, of sequence given by: an = an-1
+ an-2
• Recursive function: rFibNum
– Determines desired Fibonacci number
– Parameters: three numbers representing first two
numbers of the Fibonacci sequence and a number n,
the desired nth Fibonacci number
– Returns the nth Fibonacci number in the sequence
Data Structures Using C++ 2E 11
 Fibonacci Number (cont’d.)

• Third Fibonacci number

– Sum of first two Fibonacci numbers
• Fourth Fibonacci number in a sequence
– Sum of second and third Fibonacci numbers
• Calculating fourth Fibonacci number
– Add second Fibonacci number and third Fibonacci
number

Data Structures Using C++ 2E 12

 Fibonacci Number (cont’d.)
• Recursive algorithm
– Calculates nth Fibonacci number
• a denotes first Fibonacci number
• b denotes second Fibonacci number
• n denotes nth Fibonacci number

Data Structures Using C++ 2E 13

 Fibonacci Number (cont’d.)

• Recursive function implementing algorithm

• Trace code execution
• Review code on page 368 illustrating the function
rFibNum

Data Structures Using C++ 2E 14

 Fibonacci Number (cont’d.)

FIGURE 6-7 Execution of rFibNum(2, 3, 4)

Data Structures Using C++ 2E 15

 Recursion on data structures
Arrays and List
• Arrays
• Lists
 Largest Element in an Array

FIGURE 6-2 list with six elements

• list: array name containing elements

• list[a]...list[b] stands for the array
elements list[a], list[a + 1], ...,
list[b]
• list length =1
– One element (largest)
• list length >1
maximum(list[a],
largest(list[a + 1]...list[b]))
Data Structures Using C++ 2E 17
 Largest Element in an Array (cont’d.)
• maximum(list[0],
largest(list[1]...list[5]))
• maximum(list[1],
largest(list[2]...list[5]), etc.
• Every time previous formula used to find largest
element in a sublist
– Length of sublist in next call reduced by one

Data Structures Using C++ 2E 18

 Largest Element in an Array (cont’d.)

• Recursive algorithm in pseudocode

Data Structures Using C++ 2E 19

 Largest Element in an Array (cont’d.)

• Recursive algorithm as a C++ function

Data Structures Using C++ 2E 20

 Largest Element in an Array (cont’d.)

FIGURE 6-3 list with four elements

• Trace execution of the following statement

cout << largest(list, 0, 3) << endl;
• Review C++ program on page 362
– Determines largest element in a list

Data Structures Using C++ 2E 21

 Largest Element in an Array (cont’d.)

FIGURE 6-4 Execution of largest(list, 0, 3)

Data Structures Using C++ 2E 22
 Print a Linked List in Reverse Order

• Function reversePrint
– Given list pointer, prints list elements in reverse order
• Figure 6-5 example
– Links in one direction
– Cannot traverse backward starting from last node

FIGURE 6-5 Linked list

Data Structures Using C++ 2E 23

 Print a Linked List in Reverse Order
(cont’d.)
• Cannot print first node info until remainder of list
printed
• Cannot print second node info until tail of second
node printed, etc.
• Every time tail of a node considered
– List size reduced by one
– Eventually list size reduced to zero
– Recursion stops

Data Structures Using C++ 2E 24

 Print a Linked List in Reverse Order
(cont’d.)
• Recursive algorithm in pseudocode

• Recursive algorithm in C++

Data Structures Using C++ 2E 25

 Print a Linked List in Reverse Order
(cont’d.)
• Function template to implement previous algorithm
and then apply it to a list

Data Structures Using C++ 2E 26

 Print a Linked List in Reverse Order
(cont’d.)

FIGURE 6-6 Execution of the statement reversePrint(first);

Data Structures Using C++ 2E 27
 Print a Linked List in Reverse Order
(cont’d.)
• The function printListReverse
– Prints an ordered linked list contained in an object of
the type linkedListType

Data Structures Using C++ 2E 28

 Converting a Number from Decimal to
Binary
• Convert nonnegative integer in decimal format (base
10) into equivalent binary number (base 2)
• Rightmost bit of x
– Remainder of x after division by two
• Recursive algorithm pseudocode
– Binary(num) denotes binary representation of num

Data Structures Using C++ 2E 29

 Converting a Number from Decimal to
Binary (cont’d.)
• Recursive function implementing algorithm

Data Structures Using C++ 2E 30

 Converting a Number from Decimal to
Binary (cont’d.)

FIGURE 6-10 Execution of decToBin(13, 2)

Data Structures Using C++ 2E 31
 Recursion or Iteration?

• Dependent upon nature of the solution and

efficiency
• Efficiency
– Overhead of recursive function: execution time and
memory usage
• Given speed memory of today’s computers, we can
depend more on how programmer envisions solution
– Use of programmer’s time
– Any program that can be written recursively can also
be written iteratively

Data Structures Using C++ 2E 32

Recursion and Backtracking: 8-Queens
Puzzle
• 8-queens puzzle
– Place 8 queens on a chess-board
• No two queens can attack each other
– Nonattacking queens
• Cannot be in same row, same column, same diagonals

FIGURE 6-11 A solution to the 8-queens puzzle

Data Structures Using C++ 2E 33

Recursion and Backtracking: 8-Queens
Puzzle (cont’d.)
• Backtracking algorithm
– Find problem solutions by constructing partial
solutions
– Ensures partial solution does not violate requirements
– Extends partial solution toward completion
– If partial solution does not lead to a solution (dead
end)
• Algorithm backs up
• Removes most recently added part
• Tries other possibilities

Data Structures Using C++ 2E 34

Recursion and Backtracking: 8-Queens
Puzzle (cont’d.)
• n-Queens Puzzle
– In backtracking, solution represented as
• n-tuple (x1, x2, . . ., xn)
• Where xi is an integer such that 1 <= xi <= n
• xi specifies column number, where to place the ith
queen in the ith row
– Solution example for Figure 6-11
• (4,6,8,2,7,1,3,5)
• Number of 8-tuple representing a solution: 8!

Data Structures Using C++ 2E 35

Recursion and Backtracking: 8-Queens
Puzzle (cont’d.)
• n-Queens Puzzle (cont’d.)
– 4-queens puzzle

FIGURE 6-12 Square board for the 4-queens puzzle

FIGURE 6-13 Finding a solution to the 4-queens puzzle

FIGURE 6-14 A solution to the 4-queens puzzle

Data Structures Using C++ 2E 36

Recursion and Backtracking: 8-Queens
Puzzle (cont’d.)
• Backtracking and the 4-Queens Puzzle
– Rows and columns numbered zero to three
– Backtracking algorithm can be represented by a tree

FIGURE 6-15 4-queens tree

Data Structures Using C++ 2E 37
Recursion and Backtracking: 8-Queens
Puzzle (cont’d.)
• 8-Queens Puzzle
– Easy to determine whether two queens in same row
or column
– Determine if two queens on same diagonal
• Given queen at position (i, j ), (row i and column j ), and
another queen at position (k, l ) , (row k and column l )
• Two queens on the same diagonal if |j – l| = |i – k|,
where |j – l| is the absolute value of j – l and so on
– Solution represented as an 8-tuple
• Use the array queensInRow of size eight
• Where queensInRow[k] specifies column position of
the kth queen in row k

Data Structures Using C++ 2E 38

Recursion and Backtracking: 8-Queens
Puzzle (cont’d.)
• 8-Queens Puzzle (cont’d.)

FIGURE 6-16 8 x 8 square board

Data Structures Using C++ 2E 39

Recursion and Backtracking: 8-Queens
Puzzle (cont’d.)
• 8-Queens Puzzle (cont’d.)
– General algorithm for the function
canPlaceQueen(k, i)

Data Structures Using C++ 2E 40

 Summary
• Recursion
– Solve problem by reducing it to smaller versions of
itself
• Recursive algorithms implemented using recursive
functions
– Direct, indirect, and infinite recursion
• Many problems solved using recursive algorithms
• Choosing between recursion and iteration
– Nature of solution; efficiency requirements
• Backtracking
– Problem solving; iterative design technique
Data Structures Using C++ 2E 41