Prime finding algorythm

SUBMITTED BY: Guest

DATE: Aug. 31, 2014, 3:42 p.m.

FORMAT: JavaScript

SIZE: 306 Bytes

Raw Download

HITS: 550

Report

//Generates list of primes smaller than 1000

var test = function(k) {
    for (var j = 2;j<((k/2)+1); j++) {
        if (k % j === 0) {
            return;
        }
    }
    println("Found prime: " + k);
};

for (var i = 2;i < 1000; i++) {
        test(i);
}