Trabb Pardo–Knuth algorithm

The Trabb Pardo–Knuth algorithm is a program introduced by Donald Knuth and Luis Trabb Pardo to illustrate the evolution of computer programming languages.

In their 1977 work "The Early Development of Programming Languages", Trabb Pardo and Knuth introduced a trivial 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 simpler 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 result

The 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
   end

The 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. Evolution of C++98, C++11 and C++14 is shown as well.

 #include <algorithm>
 #include <cmath>
 #include <iostream>

 double f(int n) { // in C++14, return type can be inferred using "auto f(int n)"
     return sqrt(abs(n)) + 5*n*n*n;
 }

 int main() {
     const int N = 11; // in C++11, can be declared as "constexpr auto N = 11;"
     int S[N];         // in C++11, can be declared as "std::array<int, N> S;"

     for(int i = 0; i < N; ++i) {
         std::cin >> S[i];
     }

     std::reverse(S, S+N); // in C++11, can be used as "std::reverse(begin(S), end(S));"

     for(int i = 0; i < N; ++i) { // in C++11, can be used as "for(auto i : S)"
         double y = f(S[i]);
         if(y > 400) {
             std::cout << i << " TOO LARGE\n";
         }
         else {
             std::cout << y << '\n';
         }
     }
 }

JavaScript implementation

This shows a JavaScript implementation using the ES7 draft, equivalent to the other implementations on this page.

let [i, l, a, {sqrt, abs}] = [0, 10, [], Math],
f = x => sqrt(abs(x)) + 5 * x ** 3,
t = (x, i) => x > 400 ? `${i} TOO LARGE` : x;
while (i++ < l + 1) a.push(prompt());
for (i -= 2; i >= 0; --i) console.log(t(f(a[i]), l - i));

References

• "The Early Development of Programming Languages" in A History of Computing in the Twentieth Century, New York, Academic Press, 1980. ISBN 0-12-491650-3 (Reprinted in Knuth, Donald E., et al., Selected Papers on Computer Languages, Stanford, CA, CSLI, 2003. ISBN 1-57586-382-0) (typewritten draft, August 1976)

External links

• Implementations in several languages