I found this remark:
<a href="https://www.cs.fsu.edu/~lacher/courses/COT4401/notes/cise_v2_i1/fortran.pdf" rel="nofollow">https://www.cs.fsu.edu/~lacher/courses/COT4401/notes/cise_v2...</a><p>The Fortran I compiler would expand each
operator with a sequence of parentheses. In a
simplified form of the algorithm, it would<p>• replace + and – with ))+(( and ))-((,
respectively;<p>• replace * and / with )*( and )/(, respectively;<p>• add (( at the beginning of each expression
and after each left parenthesis in the original
expression; and<p>• add )) at the end of the expression and before
each right parenthesis in the original
expression.<p>This is the first time I hear about this, this technique will work with today compilers vs. most others like precedence climb?
Sort of surprised that the Viterbi Algorithm (1967) doesn't make the list. The simplicity and efficiency of the algorithm for finding a maximum likelihood sequence is astounding.
Mildly surprised not to see public key crypto in there. Maybe I'm misunderstanding what makes a best algorithm?<p><a href="http://www.cesg.gov.uk/publications/Documents/nonsecret_encryption.pdf" rel="nofollow">http://www.cesg.gov.uk/publications/Documents/nonsecret_encr...</a><p>He did this in his head, and had to keep it there overnight until he got to work the next morning.<p><a href="http://www.zdnet.com/article/gchq-pioneers-on-birth-of-public-key-crypto/" rel="nofollow">http://www.zdnet.com/article/gchq-pioneers-on-birth-of-publi...</a><p>This article also shows GCHQ's failure of imagination:<p>> Ralph Benjamin: It was revolutionary in the intellectual schema, and eventually in its operational impact. We didn't then foresee the full eventual operational impact. My conclusion was that the process would be so cumbersome, especially considering the computing ability of the time, it might have been useful for the occasional short message, but its main use would be a short message to transmit a key for conventional cryptography.
For the full text:
<a href="http://www.cs.fsu.edu/~lacher/courses/COT4401/notes/cise_v2_i1/index.html" rel="nofollow">http://www.cs.fsu.edu/~lacher/courses/COT4401/notes/cise_v2_...</a><p>Ask yourself, which of the 10 have you used today?
I submitted this, mostly because I was wondering what more recent algorithms would be added to the list if you were to do a new "best algorithms up until 2015". The most recent algorithm here is from 1987. What new things from the past 30 years might qualify for future best-of lists, assuming they have enough time to gain widespread adoption?
I would've thrown a LISP or Scheme interpreter in there given (a) what McCarthy accomplished by inventing it and (b) how much has been done with it. It was to non-imperative programming what Fortran was to imperative programming.