What is Complexity?

From: "c.lang.myself@xxxxxxxxx" <c.lang.myself@xxxxxxxxx>
Date: Tue, 18 Nov 2008 20:09:17 -0800 (PST)

What is complexity of this algorithm:

int fun(int i)
{
int temp=0;
if((i==0)||(i==1))
return 1;
for(int n=1;n<i;n++)
{
temp+=fun(n)*fun(i-n);
}
return temp;
}

.

Follow-Ups:
- Re: What is Complexity?
  - From: Ed Prochak
- Re: What is Complexity?
  - From: Andrew Tomazos
- Re: What is Complexity?
  - From: Richard Heathfield

Prev by Date: Re: fast stable sort
Next by Date: Re: Red-black trees?
Previous by thread: Obtain filenames from a directory (Pcap program)
Next by thread: Re: What is Complexity?
Index(es):
- Date
- Thread

Relevant Pages

[PATCH 20/52] kstrtox: convert drivers/hwmon/
... int i, err; ... u8 reg; ... long temp; ...
(Linux-Kernel)
[PATCH 22/45] kstrtox: convert drivers/hwmon/
... int i, err; ... u8 reg; ... long temp; ...
(Linux-Kernel)
Re: C++ more efficient than C?
... If you want to do language comparisons, ... complicated algorithm, though). ... int compare ... not been in C's standard library. ...
(comp.lang.c)
Re: Converting code from single to double precision
... int VarHasData; ... void PrintFortranLine (char *s); ... int continuedFormat = FALSE; ... char temp; ...
(comp.lang.fortran)
Re: The Lisp Curse
... If one compares "apples to apples", ... just be a C procedure for par(), and the additional C code would be ignored. ... The simple algorithm can be implemented in a number ... int par ...
(comp.lang.forth)