Abstract
General design of computer algorithms and evaluation of their running time, permutations and factorials, binomial coefficients, harmonic numbers, Fibonacci numbers, generating functions, O-notation, lists, stacks, queues, deques, trees, multilinked structures, dynamic storage allocation, uniform and nonuniform random numbers, statistical tests for random number generators, fast multiplication of large integers, polynomial arithmetic, sorting (esp. quicksort), and searching. A modern classic.
Year
1981
Categories
Financial and Statistical Methods
Simulation
Quasi Random Sequences
Financial and Statistical Methods
Simulation
Random Number Generation
Actuarial Applications and Methodologies
Data Management and Information
Financial and Statistical Methods
Loss Distributions
Financial and Statistical Methods
Statistical Models and Methods
Publications
Art of Computer Programming; The
