Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
Re: [Caml-list] Applications written in O'Caml
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2002-04-12 (19:15)
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.


Do You Yahoo!?
Yahoo! Tax Center - online filing with TurboTax
To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: