Answers for "algorithm to check prime and compositre number"

C#

1

prime number checking algorithm

function isPrime(num) {
  if (num <= 3) return num > 1;
  
  if ((num % 2 === 0) || (num % 3 === 0)) return false;
  
  let count = 5;
  
  while (Math.pow(count, 2) <= num) {
    if (num % count === 0 || num % (count + 2) === 0) return false;
    
    count += 6;
  }
  
  return true;
}

Posted by: Guest on August-13-2021

Source

Code answers related to "algorithm to check prime and compositre number"

Code answers related to "C#"

C# Answers by Framework

Unity

Browse Popular Code Answers by Language

Python

Javascript

Whatever

Shell/Bash

CSS

Html

PHP

SQL

Java

C#