|
towers.cpsl
is the solution to Towers of Hanoi. Input is the number of disks. |
|
fractions.cpsl
computes the fractions 1/i, i = 1 ... 32, exactly. There is no
input. |
|
powers.cpsl
computes the values of 2i and 2-i, for i = 1
... 32. There is no input. |
|
primes.cpsl
computes the first 252 prime numbers. There is no input. |
|
postfix.cpsl
changes infix expressions into postfix expressions. Input is an
expression with each character on a separate line and the final line
having only a newline character. |
|
queens.cpsl
shows all solutions to the eight queens problem. There is no input. |
|
permute.cpsl
generates all permutations of the input string. Input is the string
to permute. |