Test update

Author: edignot

src/pirmal-numbers/primal-number.test.js

@@ -12,14 +12,11 @@ describe("Is number prime", () => {
     });
 });
 
-// describe("Is number prime Math", () => {
-//     test("Is 9 prime number", () => {
-//         expect(isNumberPrimeMath(9)).toBe(false);
-//     });
-//     test("Is 17 prime number", () => {
-//         expect(isNumberPrimeMath(17)).toBe(true);
-//     });
-//     test("Is 97 prime number", () => {
-//         expect(isNumberPrimeMath(97)).toBe(true);
-//     });
-// });
+describe("Is number prime Math", () => {
+    test("Is 17 prime number", () => {
+        expect(isNumberPrimeMath(17)).toBe(true);
+    });
+    test("Is 97 prime number", () => {
+        expect(isNumberPrimeMath(97)).toBe(true);
+    });
+});

src/pirmal-numbers/primal-numbers.js

@@ -12,11 +12,12 @@ export const isNumberPrime = (num) => {
 
 // Algorithm optimization with Math.sqrt()
 export const isNumberPrimeMath = (num) => {
-    let isPrime = true;
     for (let i = 2; i < Math.sqrt(num); i++) {
         if (num % i === 0) {
-            isPrime = false;
+            return false;
         }
     }
-    return isPrime;
+    return true;
 };
+
+console.log(isNumberPrimeMath(4));

src/power-of-two/power-of-two.js

@@ -1,10 +1,11 @@
 // Problem: Is given number a power of two?
 // Time complexity: logarithmic O(log n)
 
-export const isPowerOfTwo = (num) => {
+const isPowerOfTwo = (num) => {
     if (num > 1 && num % 2 === 0) return isPowerOfTwo(num / 2);
     if (num < 1) return false;
     if (num === 1) return true;
     if (num % 2 !== 0) return false;
 };
 
+export default isPowerOfTwo;