Finding All Primes Less Than Some Maximum C.C.Handley University of Natal Durban4001

dc.contributor.author	Handley, C.C.
dc.date.accessioned	2018-05-28T15:30:53Z
dc.date.available	2018-05-28T15:30:53Z
dc.date.issued	1986
dc.identifier.citation	Handley, C.C. (1986)Finding All Primes Less Than Some Maximum . Quaestiones Informaticae Vol 4 No 2 1986	en
dc.identifier.issn	0254-2757
dc.identifier.uri	http://hdl.handle.net/10500/24135
dc.description.abstract	The problem of finding all prime numbers less than some specified maximum is frequently set as an exercise to beginning programmers, particular students doing their first programming course at University. Several different solutions to this problem are presented and tested. Experimentally derived timings are presented for these algorithms implemented in different languages. From these times, we can draw the conclusions that using only primes as divisors is not significantly faster than using all odd numbers, and that, in certain circumstances, FORTRAN programs may well take longer than equivalent Pascal programs.	en
dc.language.iso	en	en
dc.publisher	Computer Society of South Africa (on behalf of SAICSIT)	en
dc.title	Finding All Primes Less Than Some Maximum C.C.Handley University of Natal Durban4001	en
dc.type	Article	en
dc.description.department	School of Computing	en