Editing Timeline of algorithms (section)

==Before 1940==
* 1540 – [[Lodovico Ferrari]] discovered a method to find the roots of a [[Quartic function|quartic polynomial]]
* 1545 – [[Gerolamo Cardano]] published Cardano's method for finding the roots of a [[Cubic function|cubic polynomial]]
* 1614 – [[John Napier]] develops method for performing calculations using [[logarithm]]s
* 1671 – [[Newton's method|Newton–Raphson method]] developed by [[Isaac Newton]]
* 1690 – [[Newton's method|Newton–Raphson method]] independently developed by [[Joseph Raphson]]
* 1706 – [[John Machin]] develops a quickly converging inverse-tangent series for π and computes π to 100 decimal places
* 1768 – [[Leonhard Euler]] publishes his method for numerical integration of ordinary differential equations in problem 85 of Institutiones calculi integralis<ref>{{cite web |last1=Bruce |first1=Ian |title=Euler's Institutionum Calculi Integralis |url=http://www.17centurymaths.com/contents/integralcalculusvol1.htm |website=www.17centurymaths.com |access-date=17 May 2023 |archive-url=https://web.archive.org/web/20110201051037/http://www.17centurymaths.com/contents/integralcalculusvol1.htm |archive-date=February 1, 2011 |language=en |date=June 29, 2010 |url-status=live}}</ref>
* 1789 – [[Jurij Vega]] improves Machin's formula and computes π to 140 decimal places,
<!-- FFT?? 1965 -- * [[1805]] - [[Cooley–Tukey FFT algorithm|Cooley–Tukey algorithm]] known by [[Carl Friedrich Gauss]] -->
* 1805 – [[Cooley–Tukey FFT algorithm#History|FFT-like algorithm]] known by [[Carl Friedrich Gauss]]
* 1842 – [[Ada Lovelace]] writes the first algorithm for a computing engine
* 1903 – A [[fast Fourier transform]] algorithm presented by [[Carle David Tolmé Runge]]
* 1918 - [[Soundex]]
* 1926 – [[Borůvka's algorithm]]
* 1926 – [[Primary decomposition]] algorithm presented by [[Grete Hermann]]<ref>{{cite book|editor1-last=Ciliberto|editor1-first=Ciro|editor2-last=Hirzebruch|editor2-first=Friedrich|editor3-last=Miranda|editor3-first=Rick|editor4-last=Teicher|editor4-first=Mina|editor4-link= Mina Teicher |title=Applications of Algebraic Geometry to Coding Theory, Physics and Computation|date=2001|publisher=Springer Netherlands|location=Dordrecht|isbn=978-94-010-1011-5|url=https://www.springer.com/us/book/9781402000041|language=en}}</ref>
* 1927 – [[Hartree–Fock method]] developed for simulating a quantum many-body system in a stationary state.
* 1934 – [[Delaunay triangulation]] developed by [[Boris Delaunay]]
* 1936 – [[Turing machine]], an [[abstract machine]] developed by [[Alan Turing]], with [[Turing machine#Models equivalent to the Turing machine model|others]] developed the modern notion of ''algorithm''.