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.8 required=5.0 tests=BAYES_00,INVALID_DATE autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,79150553885a5ca0 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 1994-11-26 02:31:32 PST Path: nntp.gmd.de!xlink.net!howland.reston.ans.net!swrinde!news.uh.edu!uuneo.neosoft.com!Starbase.NeoSoft.COM!not-for-mail From: dweller@Starbase.NeoSoft.COM (David Weller) Newsgroups: comp.lang.ada Subject: Re: Help Wanted Date: 26 Nov 1994 04:19:42 -0600 Organization: NeoSoft Internet Services +1 713 684 5969 Message-ID: <3b723u$bn4@Starbase.NeoSoft.COM> References: <785770763snz@wilks.demon.co.uk> NNTP-Posting-Host: starbase.neosoft.com Date: 1994-11-26T04:19:42-06:00 List-Id: In article <785770763snz@wilks.demon.co.uk>, Ian M Wilks wrote: >Help, can you help please? > >As an assignment I have to learn enough Ada and write the following parallel >program: > >Find the prime numbers in the first 100 numbers (1, 2, 3, ... , 99, 100) >using the Sieve of Eratosthenes. Write down all numbers from 2 to 100. Hehe -- I remember an interesting implementation of this that I saw on the TeleSoft Ada compiler for AU/X (!!!!) (Pretty sure it was TeleSoft). -- Proud (and vocal) member of Team Ada! (and Team OS/2) ||This is not your Ada -- Very Cool. Doesn't Suck. || father's Ada For all sorts of interesting Ada tidbits, run the command: ||________________ "finger dweller@starbase.neosoft.com | more" (or e-mail with "finger" as subj.) |"Quitting C++ isn't so difficult, provided you show as much | | persistence stopping as you did starting." dweller |