Art of Computer Programming, Volume 1: Fundamental Algorithms, 3rd Edition 14419

This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures—the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition.

The section on mathematical preliminaries has been extensively revised to match present trends in research.

Table of Contents

1. Basic Concepts. 

Algorithms.

Mathematical Preliminaries.

Mathematical Induction.

Numbers, Powers, and Логарифмів.

Sums and Products.

Integer Functions and Elementary Number Theory.

Перестановок and Factorials.

Біном Coefficients.

Harmonic Numbers.

Fibonacci Numbers.

Generating Functions.

Analysis of an Algorithm.

Asymptotic Representations.

MIX.

Description of MIX.

The MIX Assembly Language.

Applications to Перестановок.

Some Fundamental Programming Techniques.

Підпрограм.

Coroutines.

Interpretive Routines.

Input and Output.

History and Bibliography.

2. Information Structures. 

Вступ.

Linear Lists.

Stacks, Queues, and Deques.

Sequential Allocation.

Linked Allocation.

Circular Lists.

Doubly Linked Lists.

Arrays and Orthogonal Lists.

Trees.

Traversing Binary Trees.

Binary Tree Representation of Trees.

Other Representations of Trees.

Basic Mathematical Properties of Trees.

Lists and Garbage Collection.

Multilinked Structures.

Dynamic Storage Allocation.

History and Bibliography.

Answers to Exercises. 

Appendix A. Tables of Numerical Quantities. 

1. Fundamental Constants (decimal).

2. Fundamental Constants (octal).

3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers.

Appendix B. Index to Notations.