Enumeration of prime numbers using JavaScript

This article on cool shell is attractive: Checking regular expressions of prime numbers

The Code translated into JavaScript is as follows:

Copy to ClipboardReference: [www.bkjia.com] function prime (MAX ){
Var re =/^ (11 + ?) \ 1 + $ /,
N, C = '1', s = C,
R = [], j = 0;

While (n = (s + = C). length) <MAX ){
! Re. test (s) & (r [j ++] = n );
}
Return r;
}
Alert (prime (10000). length );

As a front-end, in order to allow the above script to be applied on the actual page, we have to consider the patience and time-sharing optimization of the script in the browser.

Source: http://lifesinger.org/