Get min number

Author: edignot

src/min-number/min-number.js

@@ -0,0 +1,12 @@
+// Problem: Find smallest number inside given array
+// Time complexity: O(n)
+
+const getMinNum = (numArr) => {
+    let minNum = numArr[0];
+    numArr.forEach((el) => {
+        el < minNum && (minNum = el);
+    });
+    return minNum;
+};
+
+export default getMinNum;

src/min-number/min-number.test.js

@@ -0,0 +1,10 @@
+import getMinNum from "./min-number";
+
+describe("Min number", () => {
+    test("2nd element of fibonacci sequence", () => {
+        expect(getMinNum([4, 6, 8, 2, 5, 4])).toBe(2);
+    });
+    test("7th element of fibonacci sequence", () => {
+        expect(getMinNum([4, 5, 8])).toBe(4);
+    });
+});

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

@@ -1,4 +1,4 @@
-import { isNumberPrime, isNUmberPrimeMath } from "./primal-numbers";
+import { isNumberPrime, isNumberPrimeMath } from "./primal-numbers";
 
 describe("Is number prime", () => {
     test("Is 4 prime number", () => {
@@ -13,8 +13,8 @@ describe("Is number prime", () => {
 });
 
 describe("Is number prime Math", () => {
-    test("Is 4 prime number", () => {
-        expect(isNumberPrimeMath(4)).toBe(false);
+    test("Is 9 prime number", () => {
+        expect(isNumberPrimeMath(9)).toBe(false);
     });
     test("Is 17 prime number", () => {
         expect(isNumberPrimeMath(17)).toBe(true);

src/pirmal-numbers/primal-numbers.js

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