Editing Timeline of algorithms (section)

==1960s==
* 1960 – [[Karatsuba multiplication]]
* 1961 – [[Cyclic redundancy check|CRC (Cyclic redundancy check)]] invented by [[W. Wesley Peterson]]
* 1962 – [[AVL tree]]s
* 1962 – [[Quicksort]] developed by [[C. A. R. Hoare]]
* 1962 – [[Bresenham's line algorithm]] developed by [[Jack E. Bresenham]]
* 1962 – [[Stable marriage problem|Gale–Shapley 'stable-marriage' algorithm]] developed by [[David Gale]] and [[Lloyd Shapley]]
* 1964 – [[Heapsort]] developed by [[J. W. J. Williams]]
* 1964 – [[multigrid methods]] first proposed by [[R. P. Fedorenko]]
* 1965 – [[Cooley–Tukey FFT algorithm|Cooley–Tukey algorithm]] rediscovered by [[James Cooley]] and [[John Tukey]]
* 1965 – [[Levenshtein distance]] developed by [[Vladimir Levenshtein]]
* 1965 – [[CYK algorithm|Cocke–Younger–Kasami (CYK) algorithm]] independently developed by [[Tadao Kasami]]
* 1965 – [[Buchberger's algorithm]] for computing [[Gröbner basis|Gröbner bases]] developed by [[Bruno Buchberger]]
* 1965 – [[LR parser]]s invented by [[Donald Knuth]]
* 1966 – [[Dantzig algorithm]] for shortest path in a graph with negative edges
* 1967 – [[Viterbi algorithm]] proposed by [[Andrew Viterbi]]
* 1967 – [[CYK algorithm|Cocke–Younger–Kasami (CYK) algorithm]] independently developed by [[Daniel H. Younger]]
* 1968 – [[A* search algorithm|A* graph search algorithm]] described by [[Peter E. Hart|Peter Hart]], [[Nils Nilsson (researcher)|Nils Nilsson]], and [[Bertram Raphael]]
* 1968 – [[Risch algorithm]] for indefinite integration developed by [[Robert Henry Risch]]
* 1969 – [[Strassen algorithm]] for matrix multiplication developed by [[Volker Strassen]]