[REBOL] Speed testing prime functions..
From: james::mustard::co::nz at: 29-Nov-2001 7:36
Hi to all the prime lovers out there :) Could someone give me some feedback on the fastest way to implement prime checks in Rebol - Currently I use: prime?: func [p /local c v][ v: true for c 2 (p - 1) 1 [ if p // c = 0 [v: false break] ] v ] Is there a better way to do this? I have seen another implementation but that was about 60 or so lines and seemed slower... James.