<cfscript>
function woodPrimes(num) {
    var i = 0;
    var p = 1;
    var m = 0;
    var l = 0;
    var arr = [];
    var arr2 = [];

    while (++i <= num) arr[i] = i;

    while(++p<arrayLen(arr)) {
        i = 1;
        if(!arr[p]) continue;
        while (++i <= num) {
            m = p*i;

            if (m<=num) {
                arr[m] = 0;
            } else {
                break;
            }
        }
    }

    i = 0;
    while (++i <= arrayLen(arr)) {
        if(arr[i] > 1 && arr[i] < num) arr2[arrayLen(arr2)+1] = arr[i];
    }

    return arr2;
}

function primes(to) {
    var primes = [2,3];
    for (var i = 5; i <= to; ++i) {
        var root = sqr(i);
        for (var j = 1; primes[j] <= root && i % primes[j] != 0; ++j);
        if (primes[j] > root) {
            arrayAppend(primes, i);
        }
    }
    return primes;
}

times = [];
count = 10000;
its = 100;

for (c=1;c<=its;c++) {
    start = getTickCount();
    woodprimes(count);
    arrayAppend(times,getTickCount()-start);
}
writeOutput("An average of " & arrayAvg(times) & " miliseconds for to find all primes up to " & count & " over " & its & " iterations.");
</cfscript>