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.
"About this title" may belong to another edition of this title.
Book Description Prentice-Hall, 1987. Book Condition: Fair. This book has soft covers. Ex-library, With usual stamps and markings, In fair condition, suitable as a study copy. Bookseller Inventory # 3317681
Book Description Paperback. Book Condition: Good. The book has been read but remains in clean condition. All pages are intact and the cover is intact. Some minor wear to the spine. Bookseller Inventory # GOR007612990