Algorithm Preview
Reference: is_prime (0 to 9,000,000)
function is_prime(n) {
if (n <= 1) return false;
for (let i = 2, end = Math.sqrt(n); i <= end; i++) {
if (n % i === 0) return false;
}
return true;
}
Performance Comparison
| Lang | Category | Time |
|---|
Run Real Benchmarks
Execute actual benchmark tests on the server. Choose a language to run the prime number algorithm.
Community Feedback
Recent Comments