Most expressive algorithm for the history of computing class?
For a history of computing class, it would be useful-and-entertaining to demonstrate a simple algorithm, implemented in different languages. Thus, one will see how programming languages evolve. Such algorithm must be small but expressive, widespread and practically useful. The purpose is not to show an algorithm, but rather how programming languages evolve and how new languages help to make things simpler and shorter. 

The set of programming languages to be used, includes Lisp, Fortran, Prolog, Pascal, C, Python, Haskell. 

 - What algorithm could be the most appropriate for such task? 
 - Can you please also show how it can be implemented using any of the given languages?

Thank you in advance!


Most expressive algorithm for the history of computing class?
===

For a history of computing class, it would be useful-and-entertaining to demonstrate a simple algorithm, implemented in different languages. Thus, one will see how programming languages evolve. Such algorithm must be small but expressive, widespread and practically useful. The purpose is not to show an algorithm, but rather how programming languages evolve and how new languages help to make things simpler and shorter. 

The set of programming languages to be used, includes Lisp, Fortran, Prolog, Pascal, C, Python, Haskell. 

 - What algorithm could be the most appropriate for such task? 
 - Can you please also show how it can be implemented using any of the given languages?

Thank you in advance!

