Updated the problem10 solution

thivagar-manickam · thivagar-manickam · commit 311c86a1cf85 · 2021-05-08T10:37:35.000+05:30
diff --git a/Project-Euler/Problem10.js b/Project-Euler/Problem10.js
@@ -1,19 +1,21 @@
 // https://projecteuler.net/problem=10
 
 const isPrime = (number) => {
-  let flag = true
-  for (let j = number - 1; j >= 2; j--) {
+  if (number === 2) return true
+  if (number % 2 === 0) return false
+
+  for (let j = 3; j * j <= number; j += 2) {
     if (number % j === 0) {
-      flag = false
+      return false
     }
   }
-  return flag
+  return true
 }
 
 const calculateSumOfPrimeNumbers = (maxNumber) => {
   let sum = 0
   for (let i = maxNumber - 1; i >= 2; i--) {
-    if (isPrime(i) === true) {
+    if (isPrime(parseInt(i)) === true) {
       sum += i
     }
   }

Original file line number	Diff line number	Diff line change
`@@ -1,19 +1,21 @@`
`1`	`1`	`// https://projecteuler.net/problem=10`
`2`	`2`
`3`	`3`	`const isPrime = (number) => {`
`4`		`- let flag = true`
`5`		`- for (let j = number - 1; j >= 2; j--) {`
	`4`	`+ if (number === 2) return true`
	`5`	`+ if (number % 2 === 0) return false`
	`6`	`+`
	`7`	`+ for (let j = 3; j * j <= number; j += 2) {`
`6`	`8`	`if (number % j === 0) {`
`7`		`- flag = false`
	`9`	`+ return false`
`8`	`10`	`}`
`9`	`11`	`}`
`10`		`- return flag`
	`12`	`+ return true`
`11`	`13`	`}`
`12`	`14`
`13`	`15`	`const calculateSumOfPrimeNumbers = (maxNumber) => {`
`14`	`16`	`let sum = 0`
`15`	`17`	`for (let i = maxNumber - 1; i >= 2; i--) {`
`16`		`- if (isPrime(i) === true) {`
	`18`	`+ if (isPrime(parseInt(i)) === true) {`
`17`	`19`	`sum += i`
`18`	`20`	`}`
`19`	`21`	`}`