Circular primes: Difference between revisions

Circular primes (view source)

76 bytes added , 2 years ago

m

→‎{{header|Free Pascal}}: doesn't take 2.6 s for the first 19 but 0.073s til 999999

Anonymous user

Revision as of 12:31, 18 November 2021 (view source) rosettacode>Horst.h (→‎{{header\|Perl}}: perpend =={{header\|Pascal}}== test up to 10 digits) ← Older edit		Revision as of 13:09, 18 November 2021 (view source) rosettacode>Horst.h m (→‎{{header\|Free Pascal}}: doesn't take 2.6 s for the first 19 but 0.073s til 999999) Newer edit →
Line 1,656: const MAXCNTOFDIGITS = 6;//10;//11 MAXDGTVAL = 3; conv : array[0..MAXDGTVAL+1] of byte = (9,7,3,1,0); Line 1,814: 19 199933 Real time: 20.~~691~~073 s ~~CPU~~ ~~share:~~digit ~~99.44~~Count MAXCNTOFDIGITS = %6; ~~one~~Real time: 2.691 s digit ~~more~~Count MAXCNTOFDIGITS = 1110; Real time: 24.545 s~~</pre>~~ digit Count MAXCNTOFDIGITS = 11; </pre> =={{header\|Perl}}== {{trans\|Raku}}