- Timeline of algorithms
The following

**timeline**outlines the development of(mainly "mathematical recipes") since their inception.algorithm s**Before Modern Era*** Before -

Writing about "recipes " (on cooking, rituals, agriculture and other themes)

* c.1600 BC -Babylonia ns develop earliest known algorithms forfactorization and findingsquare root s

* c.300 BC - Euclid's algorithm

* c.200 BC - theSieve of Eratosthenes

*263 AD -Gaussian elimination described byLiu Hui

*628 -Chakravala method described byBrahmagupta

* c.820 -Al-Khawarizmi described algorithms for solvinglinear equation s andquadratic equation s in his "Algebra"; the word "algorithm" comes from his name

*825 -Al-Khawarizmi described thealgorism , algorithms for using the Hindu-Arabic numerals , in his treatise "On the Calculation with Hindu Numerals", which was translated into Latin as "Algoritmi de numero Indorum", where "Algoritmi", the translator's rendition of the author's name gave rise to the wordalgorithm (Latin "algorithmus") with a meaning "calculation method"

* c.850 -Cryptanalysis andfrequency analysis algorithms developed byAl-Kindi (Alkindus) in "A Manuscript on Deciphering Cryptographic Messages", which contains algorithms on breakingencryption s andcipher s. [*Simon Singh, "The Code Book", pp. 14-20*] [*cite web |url=http://www.muslimheritage.com/topics/default.cfm?ArticleID=372 |title= Al-Kindi, Cryptgraphy, Codebreaking and Ciphers |accessdate=2007-01-12 |format= HTML |work=*]

* c.1025 -Ibn al-Haytham (Alhazen), was the first mathematician to derive the formula for the sum of the fourth powers, and in turn, he develops an algorithm for determining the general formula for the sum of anyintegral powers, which was fundamental to the development of integral calculusVictor J. Katz (1995). "Ideas of Calculus in Islam and India", "Mathematics Magazine"**68**(3), p. 163-174.]

* c.1400 -Ahmad al-Qalqashandi gives a list ofcipher s in his "Subh al-a'sha" which include both substitution and transposition, and for the first time, a cipher with multiple substitutions for eachplaintext letter; he also gives an exposition on and worked example ofcryptanalysis , including the use of tables ofletter frequencies and sets of letters which can not occur together in one word**Before 1940***

1614 -John Napier develops method for performing calculations usinglogarithm s

*1671 -Newton-Raphson method developed byIsaac Newton

*1690 -Newton-Raphson method independently developed byJoseph Raphson

*1706 -John Machin develops a quickly converging inverse-tangent series for π and computes π to 100 decimal places,

*1789 -Jurij Vega improves Machin's formula and computes π to 140 decimal places,

*1805 - FFT-like algorithm known byCarl Friedrich Gauss

*1903 - AFast Fourier Transform algorithm presented byCarle David Tolme Runge

*1926 -Boruvka's algorithm

*1934 -Delaunay triangulation developed byBoris Delaunay

*1936 -Turing machine , anabstract machine developed byAlan Turing , with others developed the modern notion of "algorithm".**1940s***

1942 - AFast Fourier Transform algorithm developed byG.C. Danielson andCornelius Lanczos

*1945 -Merge sort developed byJohn von Neumann

*1947 -Simplex algorithm developed byGeorge Dantzig **1950s***

1952 -Huffman coding developed byDavid A. Huffman

*1953 -Simulated annealing introduced byNicholas Metropolis

*1954 -Radix sort computer algorithm developed byHarold H. Seward

*1956 -Kruskal's algorithm developed byJoseph Kruskal

*1957 -Prim's algorithm developed byRobert Prim

* 1957 -Bellman-Ford algorithm developed byR. Bellman andL. R. Ford, Jr.

*1959 -Dijkstra's algorithm developed byEdsger Dijkstra

* 1959 -Shell sort developed byD. L. Shell

* 1959 -De Casteljau's algorithm developed byPaul de Casteljau **1960s***

1962 -Quicksort developed byC. A. R. Hoare

* 1962 -Ford-Fulkerson algorithm developed byL. R. Ford, Jr. andD. R. Fulkerson

* 1962 -Bresenham's line algorithm developed byJack E. Bresenham

*1964 -Heapsort developed byJ. W. J. Williams

*1964 -multigrid methods first proposed byR. P. Fedorenko

*1965 - Cooley-Tukey algorithm rediscovered byJames Cooley andJohn Tukey

* 1965 -Levenshtein distance developed byVladimir Levenshtein

* 1965 - Cocke-Younger-Kasami (CYK) algorithm independently developed byT. Kasami

* 1966 -Dantzig algorithm for shortest path in a graph with negative edges

*1967 -Viterbi algorithm proposed byAndrew Viterbi

* 1967 - Cocke-Younger-Kasami (CYK) algorithm independently developed byD. H. Younger

*1968 - A* graph search algorithm described by Peter Hart,Nils Nilsson , andBertram Raphael .**1970s***

1970 -Knuth-Bendix completion algorithm developed byDonald Knuth andP. B. Bendix

* 1970 -BFGS method of the quasi-Newton class

*1972 -Graham scan developed byRonald Graham

*1973 -RSA encryption algorithm discovered byClifford Cocks

* 1973 -Jarvis march algorithm developed byR. A. Jarvis

*1974 - Pollard's "p" − 1 algorithm developed by John Pollard

*1975 -Genetic algorithm s popularized by John Holland

* 1975 -Pollard's rho algorithm developed by John Pollard

* 1975 -Aho-Corasick algorithm developed byAlfred V. Aho andMargaret J. Corasick

*1976 -Salamin-Brent algorithm independently discovered byEugene Salamin and Richard Brent

* 1976 -Knuth-Morris-Pratt algorithm developed byDonald Knuth andVaughan Pratt and independently byJ. H. Morris

*1977 -Boyer-Moore string search algorithm for searching the occurrence of a string into another string.

*1977 -RSA encryption algorithm rediscovered byRon Rivest ,Adi Shamir , andLen Adleman

* 1977 -LZ77 algorithm developed byAbraham Lempel andJacob Ziv

* 1977 -multigrid methods developed independently byAchi Brandt andWolfgang Hackbusch

*1978 -LZ78 algorithm developed fromLZ77 byAbraham Lempel andJacob Ziv

* 1978 - Bruun's algorithm proposed for powers of two byG. Bruun

*1979 - Khachiyan'sellipsoid method developed byLeonid Khachiyan **1980s***

1981 -Quadratic sieve developed byCarl Pomerance

*1983 -Simulated annealing developed byS. Kirkpatrick ,C. D. Gelatt andM. P. Vecchi

*1984 - LZW algorithm developed fromLZ78 byTerry Welch

* 1984 -Karmarkar's interior-point algorithm developed byNarendra Karmarkar

*1985 -Simulated annealing independently developed byV. Cerny

*1986 -Blum Blum Shub proposed byL. Blum ,M. Blum , andM. Shub

*1987 -Fast multipole method developed byLeslie Greengard and Vladimir Rokhlin

*1988 -Special number field sieve developed by John Pollard**1990s***

1990 -General number field sieve developed from SNFS byCarl Pomerance ,Joe Buhler ,Hendrik Lenstra , andLeonard Adleman

* 1991 - Wait-free synchronization developed byMaurice Herlihy

*1992 -Deutsch-Jozsa algorithm proposed byD. Deutsch andR. Jozsa

*1994 -Shor's algorithm developed byPeter Shor

* 1994 -Burrows-Wheeler transform developed byMichael Burrows and David Wheeler

*1996 - Bruun's algorithm generalized to arbitrary even composite sizes byH. Murakami

* 1996 -Grover's algorithm developed byLov K. Grover

* 1996 -RIPEMD-160 developed byHans Dobbertin ,Antoon Bosselaers , andBart Preneel

*1998 -rsync algorithm developed byAndrew Tridgell

*1999 -Yarrow algorithm designed byBruce Schneier , John Kelsey, andNiels Ferguson **2000s***

2001 -LZMA compression algorithm

*2002 -AKS primality test developed byManindra Agrawal ,Neeraj Kayal andNitin Saxena **References**

*Wikimedia Foundation.
2010.*