Browse thread
Re: [Caml-list] Applications written in O'Caml
[
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: | Eric Merritt <cyberlync@y...> |
| Subject: | Re: [Caml-list] Simple question |
> erg, apply_fun_list become tail recursive, but it's > in O(n^2) (when > the first version is in O(n)), and as @ is not tail > recursive, this > doesn't resolve the problem of Usage of the > stack.... > > better stick to the non tail recursive version that > to do this. by this I assume that the '@' function is not as strait forward as I thought it would be? In what manner does it append to the list to make the time 0(n^2)? -just curious. Thanks Eric __________________________________________________ Do You Yahoo!? Yahoo! Tax Center - online filing with TurboTax http://taxes.yahoo.com/ ------------------- 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