isPrimeNumber

by Matthew Vasallo

JavaScript

// Create a isNumberPrime method
// A prime number is only divisible by itself and 1

const isNumberPrimeNonRecursive = (num) => {
  if (num <= 1) {
    return false
  } else {
    for (let i = 2; i < num; i++) {
      if (num % i === 0) {
        return false
      }
    }
  }
  return true
}

console.log('isNumberPrimeNonRecursive: 3 ', isNumberPrimeNonRecursive(3));
console.log('isNumberPrimeNonRecursive: 4 ', isNumberPrimeNonRecursive(4));
console.log('isNumberPrimeNonRecursive: 5 ', isNumberPrimeNonRecursive(5));
console.log('isNumberPrimeNonRecursive: 6 ', isNumberPrimeNonRecursive(6));
console.log('isNumberPrimeNonRecursive: 27 ', isNumberPrimeNonRecursive(27));


const isNumberPrimeRecursive = (num) => {
  if (num <= 1) {
    return false
  } else {
	return num === 2 ? true : isNumberPrimeRecursive(num) 
	}
}