Timeline of Algorithms - 1950s

1950s

• 1952 - Huffman coding developed by David A. Huffman
• 1953 - Simulated annealing introduced by Nicholas Metropolis
• 1954 - Radix sort computer algorithm developed by Harold H. Seward
• 1956 - Kruskal's algorithm developed by Joseph Kruskal
• 1957 - Prim's algorithm developed by Robert Prim
• 1957 - Bellman–Ford algorithm developed by Richard E. Bellman and L. R. Ford, Jr.
• 1959 - Dijkstra's algorithm developed by Edsger Dijkstra
• 1959 - Shell sort developed by Donald L. Shell
• 1959 - De Casteljau's algorithm developed by Paul de Casteljau