Browse thread
[Caml-list] Loop times
-
Daniel M. Albro
-
Fabrice Le Fessant
-
Daniel M. Albro
- Daniel M. Albro
-
Daniel M. Albro
-
Fabrice Le Fessant
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Daniel M. Albro <albro@h...> |
| Subject: | Re: [Caml-list] Loop times |
Sorry, I just meant that the version that puts the exception into a variable outside of the loop is a win over the one that creates the exception inside the loop. The fastest loop routine overall was the tail recursive loop, i.e. the functional/recursive. However, this latest imperative version has timing that's very close -- the imperative version that pre-builds the exception takes just over 28 seconds, and the tail-recursive version takes just under 27 seconds. - Dan Oliver Bandel wrote: > On Mon, Mar 17, 2003 at 10:59:27AM -0800, Daniel M. Albro wrote: > [...] > >>so it is definitely a win. > > > What is a win? > > So much different versions, spread over several mails... > > Is functional/recursive a win over imperative? > Or vice versa? Or what? > > Ciao, > Oliver > ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners