Prime Numbers

by arunoda

JavaScript

function isPrime(number) {
  let iterations = 0
	let divisor = 2
  
  if (number <= 1) return [false, iterations]
  
  while (divisor * 2 <= number) {
    iterations ++
  	if (number % divisor === 0) return [false, iterations];
    divisor ++
  }
  
  return [true, iterations];
}

console.log(isPrime(17));