Publisher's Synopsis
This text emphasizes design techniques in general, presenting algorithms as products of design techniques. The author reduces the complexity of design strategy by reducing each problem into a series of smaller problems, thus showing the naturalness of induction and recursion. The text contains a wide variety of proof techniques including the novel introduction of recursion as a design and proof technique. An appendix on elementary data structures completes the text.;This book should be of interest to degree and diploma students taking courses in data structures or analysis of algorithms in departments of computer science.
