内容

目次

1. Basic Concepts. Algorithms. Mathematical Preliminaries.Mathematical Induction. Numbers, Powers, and Logarithms. Sums and Products.Integer Functions and Elementary Number Theory. Permutations andFactorials. Binomial Coefficients. Harmonic Numbers. Fibonacci Numbers.Generating Functions. Analysis of an Algorithm. Asymptotic Representations.MIX. Description of MIX. The MIX Assembly Language. Applications toPermutations. Some Fundamental Programming Techniques. Subroutines.Coroutines. Interpretive Routines. Input and Output. History andBibliography. 2. Information Structures. Introduction. 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. OtherRepresentations of Trees. Basic Mathematical Properties of Trees. Lists andGarbage Collection. Multilinked Structures. Dynamic Storage Allocation.History and Bibliography. Answers to Exercises. Appendix A. Tables ofNumerical Quantities. 1. Fundamental Constants (decimal). 2. FundamentalConstants (octal). 3. Harmonic Numbers, Bernoulli Numbers, FibonacciNumbers. Appendix B. Index to Notations. Index and Glossary.0201896834T02272003