Main Page
encyclopedia.codeboy.net
List of algorithm general topics
This is a
list of
algorithm
general topics
, by Wikipedia page.
Analysis of algorithms
\n*
Ant colony algorithm
\n*
Approximation algorithm
\n*
Best and worst cases
\n*
Big O notation
\n*
Bulletproof algorithm
\n*
Combinatorial search
\n*
Competitive analysis
\n*
Computability theory
\n*
Computational complexity theory
\n*
Embarrassingly parallel problem
\n*
Emergent algorithm
\n*
Evolutionary algorithm
\n*
Fast Fourier transform
\n*
Genetic algorithm
\n*
Graph exploration algorithm
\n*
Heuristic
\n*
Hill climbing
\n*
Implementation
\n*
Las Vegas algorithm
\n*
Lock-free and wait-free algorithms
\n*
Monte Carlo algorithm
\n*
Numerical analysis
\n*
Online computations and algorithms
\n*
Polynomial time approximation scheme
\n*
Problem size
\n*
Pseudorandom number generator
\n*
Quantum algorithm
\n*
Random-restart hill climbing
\n*
Randomized algorithm
\n*
Running time
\n*
Sort algorithm
\n*
Search algorithm
\n*
Tree search algorithm
See also:
list of algorithms
for specific algorithms\n*
list of computability and complexity topics
for more abstract theory\n*
list of complexity classes
,
complexity class
\n*
list of data structures
.
Category:Topic lists
"An inconvenience is only an adventure wrongly considered; an adventure is an inconvenience rightly considered." - Gilbert Keith Chesterton (1874-1936)
