• see also:
• optimisation [1/2]
• || [help]

[REBOL] Re: Speed testing prime functions..

From: lmecir:mbox:vol:cz at: 29-Nov-2001 0:06

Hello,

wrong order of sets in my formula:

use [d] [
    d: [2 3 5 7]
    prime?: function [p] [c s l] [
        l: to integer! square-root p
        foreach v d [
            if p // v = 0 [return p = v]
            if v >= l [return true]
        ]
        c: (last d) + s: 6 - ((last d) // 3 * 2)
        while [c <= l] [
            if prime? c [
                append d c
                if p // c = 0 [return false]
            ]
            c: c + s: 6 - s
        ]
        true
    ]
]

1 · 2 · 3 · 4 · 5 · 6 · 7 · 8 · [9] · 10 · 11 · See whole thread