Abstract:
We assess the \computer science" capabilities of our cP systems by solving a version of a famous programming pearl, originally posed by Jon Bentley (1984): printing the most common words in a text le, in their frequency order. Several interesting solutions have been proposed by Knuth (an exquisite model of literate programming, 1986), McIlroy (an engineering example of combining a timeless set of tools, 1986), Hanson (an alternate e cient solution, 1987). Here we propose a concise e cient solution based on the fast parallel and associative capabilities of our cP systems. We also brie y check their sorting capabilities and propose a dynamic version of the classical pigeonhole algorithm.