From Chessprogramming wiki
Jump to: navigation, search

Home * Programming * Algorithms


in mathematics and computer science, methods for solving a problem expressed as a finite sequence of instructions. The term “algorithm” is derived from the name of Muḥammad ibn Mūsā al-Khwārizmī (born approximately 780 in Khwarezm, died between 835 and 850), the Persian mathematician, astronomer, geographer, and scholar in the House of Wisdom in Baghdad, from the Khorasan province of present-day Uzbekistan [2] .

General Concepts

Sorting and Searching

Enumeration and Backtracking

Mathematical Optimization


See also


1960 ...

Volume 1 - Fundamental Algorithms (1968)
Volume 2 - Seminumerical Algorithms (1969)
Volume 3 - Sorting and Searching (1973)
Volume 4 - Combinatorial Algorithms in preparation (five fascicles have been published as of April 2009)
Volume 4A - Enumeration and Backtracking
Volume 4B - Graph and Network Algorithms
Volume 4C and possibly 4D - Optimization and Recursion
Volume 5 - Syntactic Algorithms, planned (as of August 2006, estimated in 2015).

1970 ...

1980 ...

1990 ...

2000 ...

2010 ...

External Links


Algorithms for calculating variance
Approximation algorithm from Wikipedia
Cryptographic hash algorithms
Divide and conquer algorithm
Deterministic algorithm
Distributed algorithms
Nondeterministic algorithm
Parallel algorithm
Quantum algorithm
Las Vegas algorithm
Monte Carlo algorithm
Pseudorandom number generator

Algebra and Calculus

Karatsuba algorithm from Wikipedia
Algorithms: Design and Analysis, Part 1 by Tim Roughgarden, Stanford University, Coursera, YouTube Video


Digital Differential Analyzer (graphics algorithm)
Bresenham's line algorithm
Xiaolin Wu's line algorithm
De Boor's algorithm
De Casteljau's algorithm

Linear Programming

Sorting and Searching

A* from Wikipedia
Bellman–Ford algorithm
Dijkstra's algorithm
Flooding algorithm
Floyd–Warshall algorithm
Greedy algorithm
Hill climbing
Kruskal's algorithm
Nearest neighbour algorithm
String searching algorithm




Up one Level