The design and analysis of computer algorithms

With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded exercises at the end of each chapter. 0201000296B04062001 1. Models Of Computation -- 2. Design Of Efficient Algorithms -- 3. Sorting And Order Statistics -- 4. Data Structures For Set Manipulation Problems -- 5. Algorithms On Graphs -- 6. Matrix Multiplication And Related Operations -- 7.the Fast Fourier Transform And Its Applications -- 8. Integer And Polynomial Arithmetic -- 9. Pattern-matching Algorithms -- 10. Np-complete Problems -- 11. Some Provably Intractable Problems -- 12. Lower Bounds On Numbers Of Arithmetic Operations. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman. Includes Index. Bibliography: P. [451]-462. The Design and Analysis of Computer Algorithms introduces the basic data structures and programming techniques often used in efficient algorithms. It covers the use of lists, push-down stacks, queues, trees, and graphs.