From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: 103376,9dfc10efb95ba130
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news4.google.com!feeder.news-service.com!news.mixmin.net!aioe.org!not-for-mail
From: "John B. Matthews" <nospam@nospam.invalid>
Newsgroups: comp.lang.ada
Subject: Re: Inefficient algorithms
Date: Wed, 15 Sep 2010 17:45:14 -0400
Organization: The Wasteland
Message-ID: <nospam-3110BE.17451415092010@news.aioe.org>
References: 
 <18f4ae08-3112-4f98-bb69-b76ebae6d2b2@p37g2000pra.googlegroups.com>
NNTP-Posting-Host: LQJtZWzu+iKlBROuDg+IUg.user.speranza.aioe.org
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 7bit
X-Complaints-To: abuse@aioe.org
X-Notice: Filtered by postfilter v. 0.8.2
User-Agent: MT-NewsWatcher/3.5.3b3 (Intel Mac OS X)
Xref: g2news1.google.com comp.lang.ada:14098
Date: 2010-09-15T17:45:14-04:00
List-Id: <comp.lang.ada>

In article 
<18f4ae08-3112-4f98-bb69-b76ebae6d2b2@p37g2000pra.googlegroups.com>,
 Rick <rickduley@gmail.com> wrote:

> Thanks BrianG but I was chasing O(2^n).

The traditional recursive Fibonacci algorithm is exponential in n.

<http://courses.csail.mit.edu/6.01/spring07/lectures/lecture4.pdf>

-- 
John B. Matthews
trashgod at gmail dot com
<http://sites.google.com/site/drjohnbmatthews>