Descending primes: Difference between revisions
Content added Content deleted
(Added Algol W) |
m (→{{header|ALGOL W}}: The procedure should, of course be called descending_primes...) |
||
Line 213: | Line 213: | ||
% number of descending primes - primes must be big enough, e.g. have 511 % |
% number of descending primes - primes must be big enough, e.g. have 511 % |
||
% elements % |
% elements % |
||
procedure |
procedure descending_primes ( integer array primes ( * ) |
||
; integer result lenPrimes |
; integer result lenPrimes |
||
) ; |
) ; |
||
begin |
begin |
||
integer array digits ( 1 :: 9 ); |
integer array digits ( 1 :: 9 ); |
||
Line 232: | Line 232: | ||
end for_i ; |
end for_i ; |
||
quickSort( primes, 1, lenPrimes ); |
quickSort( primes, 1, lenPrimes ); |
||
end |
end descending_primes ; |
||
begin % find the descending primes and print them % |
begin % find the descending primes and print them % |
||
integer array primes ( 1 :: 512 ); |
integer array primes ( 1 :: 512 ); |
||
integer lenPrimes; |
integer lenPrimes; |
||
descending_primes( primes, lenPrimes ); |
|||
for i := 1 until lenPrimes do begin |
for i := 1 until lenPrimes do begin |
||
writeon( i_w := 8, s_w := 0, " ", primes( i ) ); |
writeon( i_w := 8, s_w := 0, " ", primes( i ) ); |