Description
Shipping for this item is FREE, please allow 15 days for shipping. As its shipped from our Auckland warehouse there is no unexpected import charges, custom duties or taxes.
Condition: BRAND NEW
ISBN: 9781568811789
Year: 2002
Publisher: Taylor & Francis
Pages: 232
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.
Condition: BRAND NEW
ISBN: 9781568811789
Year: 2002
Publisher: Taylor & Francis
Pages: 232
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.