Algorithms : their complexity and efficiency
Author(s)
Bibliographic Information
Algorithms : their complexity and efficiency
（Wiley series in computing）
Wiley, c1987
2nd ed.
Available at 41 libraries
Note
Bibliography: p. 351-358
Includes index
Description and Table of Contents
Description
Like the first edition, this book is concerned with the study of algorithms and their complexity, and the evaluation of their performance. Algorithmic analysis continues to be an important area of research within the fields of computer science and computational mathematics and this second edition incorporates substantial changes to most chapters - in particular chapters on sorting and searching have been fully rewritten. The old- fashioned step-by-step implementation of the algorithms have been replaced by a pseudo form presentation and many new exercises, some with solutions, have been incorportated in most chapters.
Table of Contents
- Evaluation of Polynomials
- Iterative Processes
- Direct Methods for Solving Sets of Linear Equations
- The Fast Fourier Transform
- Fast Multiplications of Numbers
- Internal Sorting
- External Sorting
- Searching.
by "Nielsen BookData"