- We will send in 10–14 business days.
/images/books/11242129/9781568811789.jpg)
- Author: Herbert S Wilf
- Publisher: A K PETERS
- ISBN-10: 1568811780
- ISBN-13: 9781568811789
- Format: 15.5 x 23.1 x 1.8 cm, kieti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 22d.20:42:16
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Herbert S Wilf
- Publisher: A K PETERS
- ISBN-10: 1568811780
- ISBN-13: 9781568811789
- Format: 15.5 x 23.1 x 1.8 cm, kieti viršeliai
- Language: English English
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.
Reviews