eans log base x of n).
There's a good discussion in the textbook "Algorithms" by Cormen, Leiserson
and Rivest.
Best regards,
Van Snyder
that allow this.
It may be useful to keep this idea in mind when pondering the issues of
"state" in functional languages.
Van Snyder
program, and others, to argue for use of
functional languages, especially on our multiprocessor supercomputers
(e.g. Intel Gamma/Delta/Paragon and Cray T3D). Since I couldn't get this
simple example to work on my HP 720 (partly because 0.16+ was _so_slow_
on the 720), an
rray of high bounds)) [I know the arrays are really tuples] instead
of array of tuples (low,high). The latter could be used with the inRange
function from the Prelude, while the former cannot. But it'd probably be
_really_ hard on a lot of people to change this now.
Best regards,
Van
In the following little program, why does the definition of p, and the second
definition of q, work, but the first does not? Do I not understand Haskell,
or is this a feature of ghc?
Van Snyder = [EMAIL PROTECTED
