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.3 required=5.0 tests=BAYES_00, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,c212e60d58417232 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2004-03-12 16:12:40 PST Path: archiver1.google.com!news2.google.com!newsfeed2.dallas1.level3.net!news.level3.com!zeus.visi.com!priapus.visi.com!orange.octanews.net!news-out.visi.com!petbe.visi.com!news.octanews.net!news.linkpendium.com!border1.nntp.sjc.giganews.com!nntp.giganews.com!local1.nntp.sjc.giganews.com!nntp.gbronline.com!news.gbronline.com.POSTED!not-for-mail NNTP-Posting-Date: Fri, 12 Mar 2004 18:12:38 -0600 Date: Fri, 12 Mar 2004 19:12:39 -0500 From: Wes Groleau Reply-To: groleau+news@freeshell.org Organization: Ain't no organization here! User-Agent: Mozilla Thunderbird 0.5 (Macintosh/20040208) X-Accept-Language: en-us, en MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: [OT] Hints for an algorithm - avoiding O(n^2) References: <5d6fdb61.0403120115.7c102e3c@posting.google.com> In-Reply-To: <5d6fdb61.0403120115.7c102e3c@posting.google.com> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Message-ID: NNTP-Posting-Host: 69.9.86.21 X-Trace: sv3-kVKEp6lUD5eaGQaPtkiv706wRuELphCr2R9yWyMGd2fRsTFHhGznyXm85cYX5xc8kyLlPQ+eHLSBr5L!9HWgF20YNN5FuD0uBhBBVn2ILgXSHfCitd5tOVI9GJ+PhZxgprC6OoIZ95aP9Jwao73TteKOfw7c X-Complaints-To: abuse@gbronline.com X-DMCA-Complaints-To: abuse@gbronline.com X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly X-Postfilter: 1.1 Xref: archiver1.google.com comp.lang.ada:6297 Date: 2004-03-12T19:12:39-05:00 List-Id: Jano wrote: > I was wondering if you know of another approach more efficient. A > simple hint is enough, I'll look further as necessary once in the > right path. I would think that one could locate software already being used to compute/predict trajectories of real astronomical bodies (or unmanned spacecraft that fly near them) and if you want Ada (who wouldn't?) just translate. -- Wes Groleau Alive and Well http://freepages.religions.rootsweb.com/~wgroleau/