The Art of Computer Programming: Seminumerical algorithms

Front Cover
Addison-Wesley, 1981 - Computers - 688 pages
26 Reviews
V.1 - Fundamentals algorithms: Basic concepts. Algorithms. Mathematical preliminaries. MIX. Some fundamental programming techniques. Information structures. Linear lists. Trees. Multilinked structures. Dynamic storage allocation. History and bibliography. Random numbers. Generating uniform random numbers. Statistical tests. Other types of random quantities. What is a random sequence? Summary. Arithmetic. Positional number systems. Floating-point arithmetic. Multiple-precision arithmetic. Radix conversion. Rational arithmetic. Polynomial arithmetic. Manipulation of power series. v. 2. Seminumerical algorithms. Random numbers. Arithmetic.

From inside the book

What people are saying - Write a review

User ratings

5 stars
18
4 stars
6
3 stars
1
2 stars
0
1 star
1

LibraryThing Review

User Review  - Lyndatrue - LibraryThing

There aren't enough stars to rate this. My only regret (and it's a minor one) is that I don't have my old copies, which I gave to a friend when I bought the new and updated ones. The old ones fell ... Read full review

User Review - Flag as inappropriate

123

Contents

Chapter 3Random Numbers
1
Chapter 4Arithmetic
178
Answers to Exercises
516
Copyright

2 other sections not shown

Common terms and phrases

References to this book

All Book Search results »

About the author (1981)

Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the Tex and Metafont systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.

Bibliographic information