10 greatest algorithms in the 20th Century

In the 10th century's greatest numerical analysis class of algorithms, I read the 10th century's greatest algorithms jointly selected by computer in Science & enigeering and IEEE Computer Society: 1. Monte Carlo algorithm. 1946: John von norann, Stan Ulam, and Nick metropolis2, simple form method. 1947: George dantzig, anyone who has studied operations research knows: 3. Krylov subspace iteration algorithm. 1950: Magnus hestenes, Eduard Stiefel, and Cornelius Lanczos. I just talked about it this week. Krylov subspace: Span {S, A * S, A ^ 2 * s,..., a ^ (k-1) * s}. 4. matrix factorization algorithm. 1951: Alston householder. 5. fotran optimal compiler. 1957: John Backus. I don't know why it counts as an algorithm. Fotran is indeed a milestone in scientific computing. 6. QR algorithm. 1959-61: J. g.f. francis7. Fast sorting algorithm. 1962: Tony Hoare. It was not very early to study computer sorting. 8. FFT algorithm. 1965: James cooley9, integer relationship Determination Algorithm (integer relation detecting algorithms ). 1977: helaman Ferguson and rosydney forcade. I'm not quite sure. I heard it for the first time. 10. Fast multipole algorithm (fast multipole algorithms ). 1987: Leslie greengard and Vladimir rokhlin. N-body problem simulation, not clear