This specific ISBN edition is currently not available.View all copies of this ISBN edition:
This book is an introductory textbook on the design and analysis of algorithms. The author uses a careful selection of a few topics to illustrate the tools for algorithm analysis. Recursive algorithms are illustrated by Quicksort, FFT, fast matrix multiplications, and others. Algorithms associated with the network flow problem are fundamental in many areas of graph connectivity, matching theory, etc. Algorithms in number theory are discussed with some applications to public key encryption. This second edition will differ from the present edition mainly in that solutions to most of the exercises will be included.
"synopsis" may belong to another edition of this title.
Herbert S. Wilf is the Thomas A. Scott Professor of Mathematics at the University of Pennsylvania. In 1998 he received the Leroy P. Steele Prize for Seminal Contribution to Research, awarded by the American Mathematical Society, and in 1996 he was awarded the Deborah and Franklin Tepper Haimo Award for Distinguished College or University Teaching of mathematics.Review:
"[The examples] are selected with great care and enable the reader to concentrate directly on the main features of the demonstrated topics. . . . The book can be warmly recommended to those willing to learn (or teach) basic ideas of computational mathematics." -EMS Newsletter, March 2004
"About this title" may belong to another edition of this title.
Book Description Prentice-Hall, 1987. Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. , 500grams, ISBN:013022054X. Seller Inventory # 7324263