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=-0.9 required=5.0 tests=BAYES_00,FORGED_GMAIL_RCVD,
	FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4
X-Google-Thread: 103376,9dfc10efb95ba130,start
X-Google-NewGroupId: yes
X-Google-Attributes: gida07f3367d7,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!postnews.google.com!m35g2000prn.googlegroups.com!not-for-mail
From: Rick <rickduley@gmail.com>
Newsgroups: comp.lang.ada
Subject: Inefficient algorithms
Date: Fri, 10 Sep 2010 21:24:52 -0700 (PDT)
Organization: http://groups.google.com
Message-ID: 
 <1f6f73cd-f5ff-4408-a1d7-c9ca7dfa70ee@m35g2000prn.googlegroups.com>
NNTP-Posting-Host: 114.75.15.132
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1
X-Trace: posting.google.com 1284179092 9406 127.0.0.1 (11 Sep 2010 04:24:52
 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Sat, 11 Sep 2010 04:24:52 +0000 (UTC)
Complaints-To: groups-abuse@google.com
Injection-Info: m35g2000prn.googlegroups.com; posting-host=114.75.15.132;
 posting-account=q18aiAoAAADbiIPIlD5R8oYVGhuoBvVA
User-Agent: G2/1.0
X-HTTP-UserAgent: Mozilla/4.0 (compatible; MSIE 8.0; Windows NT 5.1;
 Trident/4.0; GTB6.5; .NET CLR 2.0.50727; .NET CLR 3.0.4506.2152;
 .NET CLR 3.5.30729),gzip(gfe)
Xref: g2news1.google.com comp.lang.ada:14004
Date: 2010-09-10T21:24:52-07:00
List-Id: <comp.lang.ada>

I am working on a class in algorithmic efficiency and, to make a
point, need an algorithm that runs O(2^n) - a factoring algorithm
perhaps.  All I can find is 'C' code I can't decipher.  Can someone
please help with an Ada example.

Thanks