Browse thread
[Caml-list] looping recursion
[
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: | Brian Hurt <bhurt@s...> |
| Subject: | Re: [Caml-list] looping recursion |
Hit "send" before I meant too- sorry.
On Tue, 27 Jul 2004 briand@aracnet.com wrote:
> however, my larger point is the fact that the "standard" map blows up
> like that. as a long time scheme user I just find that plain weird.
> Now Everybody else seems to think I'm weird because I think that's
> weird ;-)
I agree with you. Or rather, I don't think it's weird so much as really
bad. The problem is correct, and (while not as efficient as it might be)
it sounds like it's not horribly inefficient either. It's certainly not a
bad idea to get it working first, and then worry about algorithmic
inefficiencies. I'd much rather have a program that takes two minutes to
return the right answer, than a program that returns the wrong answer in 2
seconds (or segfaults in 2 milliseconds, but that isn't a danger in
Ocaml).
--
"Usenet is like a herd of performing elephants with diarrhea -- massive,
difficult to redirect, awe-inspiring, entertaining, and a source of
mind-boggling amounts of excrement when you least expect it."
- Gene Spafford
Brian
-------------------
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