Algorithm of the day #1: How would you verify a prime number? #w3Develops #100DaysofCode #Tech #freeCodeCamp #Programming #Algorithms #AlgorithmsDaily
1
5
4
0
0
Day #1 Answer: function isPrime(n){ var divisor = 2; while (n > divisor){ if(n % divisor == 0){ return false; } else divisor++; } return true; } > isPrime(137); = true > isPrime(237); = false