9.5 Practical Problems
We are excited to offer some practice problems that allow you to apply the techniques we've discussed in this chapter. These problems will help you test your understanding and apply the knowledge you've gained.
1. Recursion: Fibonacci Series
Write a recursive function that generates the nth number in the Fibonacci series. Remember, the Fibonacci sequence is a series of numbers in which each number is the sum of the two preceding ones, usually starting with 0 and 1.
2. Iterative Approach: Factorial
Write an iterative function that computes the factorial of a given number. The factorial of a non-negative integer n is the product of all positive integers less than or equal to n.
3. Backtracking: N-Queens Problem
The N Queens puzzle is the problem of placing N chess queens on an N×N chessboard so that no two queens threaten each other. Thus, a solution requires that no two queens share the same row, column, or diagonal.