Version française
Home     About     Download     Resources     Contact us    
Browse thread
Re: [Caml-list] Reporting on sucess/failure of tail recursion
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: David Thomas <david_hd@y...>
Subject: Re: [Caml-list] Reporting on sucess/failure of tail recursion
Particularly with respect to list operations,
"non-tail-recursive" usually implies stack space used
is O(n) to the length of the list, whereas "tail
recursive" implies O(1).  I, for one, would love to
see these figures explicitly, instead.

--- skaller <skaller@users.sourceforge.net> wrote:

> What needs to be documented for a library function
is its 
> complexity (time/space etc). In this sense the
documentation
> of the C++ Standard Library should be taken as an
examplar.



		
__________________________________ 
Start your day with Yahoo! - Make it your home page! 
http://www.yahoo.com/r/hs