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.

About the Author

Herbert S. Wilf

"About this title" may belong to another edition of this title.

Store Description

The Saint Bookstore has a range of over 1 million titles available.

Visit Seller's Storefront

Seller's business information

SB ONLINE LTD
50 Devonshire Road, Southport, PR9 7BZ, United Kingdom

Sale & Shipping Terms

Terms of Sale

Please order through the Abebooks checkout. We only take orders through Abebooks - We don't take direct orders by email or phone.

Refunds or Returns: A full refund of the purchase price will be given if returned within 30 days in undamaged condition.

As a seller on abebooks we adhere to the terms explained at http://www.abebooks.co.uk/docs/HelpCentral/buyerIndex.shtml - if you require further assistance please email us at orders@thesaintbookstore.co.uk

Shipping Terms

Most orders usually ship within 1-3 business days, but some can take up to 7 days.

Shipping rates from United Kingdom to U.S.A.

Shipping rates from United Kingdom to U.S.A.
Order quantity	7 to 28 business days	7 to 28 business days
First item	US$ 19.80	US$ 22.44

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.