
<hugin777@my-deja.com> a �crit dans le message :
8ct83j$ho3$1@nnrp1.deja.com...
>
> PPPS: Please educate me as to where I would find a better algorithm!

Well at least you could write MarkMultiplum this way (code not tested):

     procedure MarkMultiplum (Divisor  : in     Integer;
                              Is_Prime : in out BoolArray)
     is
        K : Integer := Divisor;
     begin
         loop
             Is_Prime (K) := False;
             K := K + Disivor;
             exit when K > Is_Prime'Last;
         end loop;
     end MarkMultiplum;

Pascal.

--

--|------------------------------------------------------------
--| Pascal Obry                               Team-Ada Member |
--|                                                           |
--| EDF-DER-IPN-SID- T T I                                    |
--|                       Intranet: http://cln46gb            |
--| Bureau N-023            e-mail: p.obry@der.edf.fr         |
--| 1 Av G�n�ral de Gaulle  voice : +33-1-47.65.50.91         |
--| 92141 Clamart CEDEX     fax   : +33-1-47.65.50.07         |
--| FRANCE                                                    |
--|------------------------------------------------------------
--|
--|         http://perso.wanadoo.fr/pascal.obry
--|
--|   "The best way to travel is by means of imagination"