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.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,9498e97c16f2b3e6
X-Google-Attributes: gid103376,public
From: boaz@usa.pipeline.com(Boaz Chow)
Subject: Re: Anybody with a Cray T3D want to help me?
Date: 1996/05/12
Message-ID: <4n47ji$avd@news2.h1.usa.pipeline.com>#1/1
X-Deja-AN: 154500299
references: <4n1urh$vhn@news.nyu.edu>
x-pipeuser: boaz
x-pipehub: usa.pipeline.com
organization: Pipeline USA
newsgroups: comp.lang.ada
x-pipegcos: (Boaz Chow)
Date: 1996-05-12T00:00:00+00:00
List-Id: <comp.lang.ada>


I think you can make the program run faster if you don't use the recursive
call. 
 
use the dynamic programming technique.  use a table to store the perviously
calculated values, etc. 
 
On May 11, 1996 11:49:05 in article <Re: Anybody with a Cray T3D want to
help me?>, 'kenner@lab.ultra.nyu.edu (Richard Kenner)' wrote: 
 
 
>In article <4mvmj5$sl6@btmpjg.god.bel.alcatel.be> ian@rsd.bel.alcatel.be  
>writes: 
>>Does anybody out there fancy running this for me? 
> 
>I don't have a Cray T3D, but just got a 266 MHz 21164-based system 
>running Linux. 
> 
>I modified your code to make BOO_ARRAY packed and ran this on GNAT 
>(with -O2).  It took two hours and 43 minutes and produced the following 
>output (I've removed line breaks to condense this posting): 
> 
>15 112 97 86 129 63 135 114 133 80 126 12 21 100 119 84 79 65 74 3 65 
>8 60 54 47 21 39 9 3 24 15 
-- 
   ______   Meow 
   \ OO /  _/  
  :(__ =) 
    U \\ 
Due to some students who mess up 
some legal issue, my school is being 
sued by some company. In return, 
all the web pages are no longer 
accessable from the rest of the world. 
http://www.sci.csupomona.edu/~cchow