Home * Programming * Algorithms
Abu_Abdullah_Muhammad_bin_Musa_al-Khwarizmi.jpg

In mathematics and computer science, an algorithm is an method 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 [1] .
Muḥammad ibn Mūsā al-Khwārizmī [2]

General Concepts


Sorting and Searching


Enumeration and Backtracking


Mathematical Optimization


Combinatorial


See also


Publications

1960 ...

  • Donald E. Knuth (1968 ...). The Art of Computer Programming (TAOCP) [3]
    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

Algebra and Calculus

Graphics


Linear Programming

Sorting and Searching

Complexity


Misc


References

  1. ^ Kurt Mehlhorn, Peter Sanders (2008). Data Structures and Algorithms: The Basic Toolbox. Springer, Appetizer: Integer Arithmetics (pdf)
  2. ^ A stamp issued September 6, 1983 in the Soviet Union, commemorating Al-Khwārizmī's (approximate) 1200th birthday
  3. ^ The Art of Computer Programming from Wikipedia
  4. ^ Ordinal optimization from Wikipedia

What links here?


Up one Level