Timeline of Algorithms - 1960s

1960s

• 1960 - Karatsuba multiplication
• 1962 - AVL trees
• 1962 - Quicksort developed by C. A. R. Hoare
• 1962 - Ford–Fulkerson algorithm developed by L. R. Ford, Jr. and D. R. Fulkerson
• 1962 - Bresenham's line algorithm developed by Jack E. Bresenham
• 1964 - Heapsort developed by J. W. J. Williams
• 1964 - multigrid methods first proposed by R. P. Fedorenko
• 1965 - Cooley–Tukey algorithm rediscovered by James Cooley and John Tukey
• 1965 - Levenshtein distance developed by Vladimir Levenshtein
• 1965 - Cocke–Younger–Kasami (CYK) algorithm independently developed by Tadao Kasami
• 1966 - Dantzig algorithm for shortest path in a graph with negative edges
• 1967 - Viterbi algorithm proposed by Andrew Viterbi
• 1967 - Cocke–Younger–Kasami (CYK) algorithm independently developed by Daniel H. Younger
• 1968 - A* graph search algorithm described by Peter Hart, Nils Nilsson, and Bertram Raphael.