Algorithms and Complexity
Overview & Synopsis
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.
Indexed from repository: FreeComputerBooks.com
(
freecomputerbooks.com)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Algorithms and Complexity |
|---|---|
| Author / Organization | Herbert S. Wilf |
| Subject & Discipline | Algorithms and Data Structures, Computational Complexity, Computational and Algorithmic Mathematics, Parallel Computing and Programming |
| Categories | Algorithms and Data Structures |
| Publication Year | 2002 |
| ISBN | 1568811780 |
| Resource Verification | Verification pending |
| Original Host Website |
FreeComputerBooks.com
(freecomputerbooks.com)
|
| File Format | application/pdf (Portable Document Format) |
| Language | ENGLISH |
| Catalog ID | DOC-259122 |
| Original Source Link | Visit Source Page on freecomputerbooks.com » |
Commercial / Print Edition
Prefer a Physical Book or Kindle Edition?
Algorithms and Complexity • Print Edition
As an Amazon Associate, MainReads earns from qualifying purchases.