 | Chapter Objectives
(See related pages)
After you have read and studied this chapter, you should be able to- Write recursive algorithms for mathematical functions and nonnumerical operations.
- Decide when to use recursion and when not to.
- Describe the recursive quicksort algorithm and explain how its performance is better than that of selection and bubble sort algorithms.
|
|