Re: Which Algorithm is Faster?
- From: "eKo1" <berndlosert@xxxxxxxxxxxx>
- Date: 27 Dec 2006 19:32:24 -0800
eKo1 wrote:
a(n) = (n+1)lg n + 2 lg (n/2) if n is even, and
a(n) = (n+1)lg n + lg [(n+1)/2] + lg [(n-1)/2] if n is odd.
I made a serious typo. It should be
a(n) = (n+1)lg n + 2 a(n/2) if n is even, and
a(n) = (n+1)lg n + a((n+1)/2) + a((n-1)/2) if n is odd.
.
- References:
- Which Algorithm is Faster?
- From: eKo1
- Which Algorithm is Faster?
- Prev by Date: Re: np-complete
- Next by Date: Re: np-complete
- Previous by thread: Re: Which Algorithm is Faster?
- Next by thread: pumping lemma question
- Index(es):
