Category
page 1Analysis of algorithms
big O notation
form of Landau notation representing asymptotically equivalent or slower growth
The Art of Computer Programming
books about algorithms by Donald Knuth
time complexity
estimate of time taken for running an algorithm
analysis of algorithms
study of resources used by an algorithm
randomized algorithm
algorithm designed to use randomness from auxiliary inputs as part of its logic
deterministic algorithm
algorithm which, given a particular input, will always produce the same output
computational complexity
measure of the amount of resources needed to run an algorithm or solve a computational problem
master theorem
method for analysis of algorithms
algorithmic efficiency
amount of computational resources used by an algorithm
amortized analysis
method for algorithm analysis in computer science
pseudo-polynomial time
Term in Complexity Theory
worst-case complexity
worst possible asymptotic complexity of an algorithm
Best, worst and average case
measure of how efficiently algorithms use resources
branching factor
computing, tree data structures, and game theory value
polylogarithmic function
polynomial in the logarithm of n
Reservoir sampling
Randomized algorithm
galactic algorithm
algorithm asymptotically very efficient but practically never so due to infeasibly large constants
average-case complexity
Algorithm charcteristic in computations
Cache-oblivious algorithm
i/O-efficient algorithm regardless of cache size
Potential method
method used to analyze the amortized time and space complexity of a data structure
out-of-core algorithm
algorithm to process data that is too large to fit into a computer's main memory at one time, optimized to efficiently fetch and access data stored in slow bulk memory (e.g. hard drives, tape drives, remote network)