Recursive Question
 From: saj.ganegoda@xxxxxxxxx
 Date: 17 Mar 2006 03:02:47 0800
Hi,
I have a theoretical question. If I have a computer that has the
ability to double its speed every time a function is called
recursively. i.e. each time it computes an recursion it
does so in half the time it took on the previous recursion. how would I
find the complexity for an algorithm?
e.g. binary search is usually O(log n). I'm guessing in this case
binary search would be O(log(log n))...am I right?
Thanks in advance
.
 FollowUps:
 Re: Recursive Question
 From: Gijs Peek
 Re: Recursive Question
 From: randyhyde@xxxxxxxxxxxxx
 Re: Recursive Question
 From: Alf P. Steinbach
 Re: Recursive Question
 From: CBFalconer
 Re: Recursive Question
 Prev by Date: Re: serialization class and endian
 Next by Date: Re: Recursive Question
 Previous by thread: Re: Is a windows programmer out there that would like to...
 Next by thread: Re: Recursive Question
 Index(es):
Relevant Pages
