[Shootout-list] Organisation for numerical tests

[Jon Harrop]

On Wednesday 04 May 2005 20:07, Sebastien Loisel wrote:
> ... but as is well known,
> purely functional data structures are slower than imperative ones.

Mutable (imperative) data structures are often faster than immutable
(functional) data structures but your statement isn't true in general, of
course. Computing the union of distinct sets being the most obvious
counter-example.

> A smart
> non-destructive approach would require a purely functional array data
> structure

Perhaps Haskell's arrays will be adequate for this? You can write in a 
functional style using OCaml's mutable arrays but correct use won't be 
enforced by the compiler.

-- 
Dr Jon D Harrop, Flying Frog Consultancy Ltd.
Objective CAML for Scientists
http://www.ffconsultancy.com/products/ocaml_for_scientists