GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/Maths/PrimeCheck.js at master · TheAlgorithms/JavaScript Expand file tree/ Copy pathPrimeCheck.jsMore file actions 25 lines (21 loc) · 446 Bytes / Copy pathPrimeCheck.jsFile metadata and controls25 lines (21 loc) · 446 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 /* Modified from: https://github.com/TheAlgorithms/Python/blob/master/maths/prime_check.py Complexity: O(sqrt(n)) */ const PrimeCheck = (n) => { // input: n: int // output: boolean if (n === 1) return false if (n === 0) return false if (n === 2) return true if (n % 2 === 0) return false for (let i = 3; i * i <= n; i += 2) { if (n % i === 0) { return false } } return true } export { PrimeCheck } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |