Embedded Files
The fifth chapter of the book examines problems that can be solved by "tail-recursive" algorithms. It uses the recursive thinking methodolgy and diagrams introduced in Chapter 2 in order to guide the reader when developing the recursive algorithms.
The chapter contains several classical topics, problems, and algorithms such as:
- Linear and binary search
- Binary search trees
- Hoare's partitioning method and the quick select algorithm
- The bisection method for root finding
- Euclid's algorithm for computing the greatest common divisor
- and several other problems
chapter05.pdfGoogle Sites
Report abuse