Knuth algorithm is a program introduced by Donald Knuth and Luis Trabb Pardo to illustrate the evolution of computer programming languages.
Contents
- The algorithm
- ALGOL 60 implementation
- C implementation
- Python implementation
- JavaScript implementation
- References
In their 1977 work "The Early Development of Programming Languages", Trabb Pardo and Knuth introduced a small program that involved arrays, indexing, mathematical functions, subroutines, I/O, conditionals and iteration. They then wrote implementations of the algorithm in several early programming languages to show how such concepts were expressed.
The trivial Hello world program has been used for much the same purpose.
The algorithm
ask for 11 numbers to be read into a sequence S reverse sequence S for each item in sequence S call a function to do an operation if result overflows alert user else print resultThe algorithm reads eleven numbers from an input device, stores them in an array, and then processes them in reverse order, applying a user-defined function to each value and reporting either the value of the function or a message to the effect that the value has exceeded some threshold.
ALGOL 60 implementation
begin integer i; real y; real array a[0:10]; real procedure f(t); real t; value t; f := sqrt(abs(t)) + 5*t^3; for i := 0 step 1 until 10 do read(a[i]); for i := 10 step -1 until 0 do begin y := f(a[i]); if y > 400 then write(i, "TOO LARGE") else write(i,y); end endThe problem with the usually specified function is that the term 5*t^3 gives overflows in almost all languages for very large negative values.
C++ implementation
This shows a C++ implementation equivalent to the above ALGOL 60.
Python implementation
This shows a Python 3.5 version using a function style and then again imperatively
JavaScript implementation
This shows a JavaScript implementation using the ES7 draft, equivalent to the other implementations on this page.