Showing with 36 additions and 0 deletions.

BIN .github/dsa.jpeg

BIN .github/logo.png

+25 −0 src/_Searching_/LinearSearch/LinearSearch.test.js

+11 −0 src/_Searching_/LinearSearch/index.js
diff --git a/.github/dsa.jpeg b/.github/dsa.jpeg
diff --git a/.github/logo.png b/.github/logo.png
diff --git a/src/_Searching_/LinearSearch/LinearSearch.test.js b/src/_Searching_/LinearSearch/LinearSearch.test.js
@@ -0,0 +1,25 @@
+const {linearSearch} = require('./LinearSearch');
+
+describe('Linear Search', () => {
+    const array = [1, 2, 3, 4, 5, 6, 7, 8];
+    describe('When element to find is at 1st position ', () => {
+        it('Linear search', () => {
+            expect(linearSearch(array, 1)).toEqual(0);
+        });
+    });
+    describe('When element to find is at last position ', () => {
+        it('Linear search', () => {
+            expect(linearSearch(array, 8)).toEqual(7);
+        });
+    });
+    describe('When element to find is at random position ', () => {
+        it('Linear search', () => {
+            expect(linearSearch(array, 3)).toEqual(2);
+        });
+    });
+    describe('When element to find is no present in array ', () => {
+        it('Linear search', () => {
+            expect(linearSearch(array, 10)).toEqual(null);
+        });
+    });           
+})
diff --git a/src/_Searching_/LinearSearch/index.js b/src/_Searching_/LinearSearch/index.js
@@ -0,0 +1,11 @@
+function linearSearch(arr, val) {
+    for (let i = 0; i < arr.length; i++) {
+        if (arr[i] === val) return i;
+    }
+    return null;
+}
+// MediaSourceHandle.exp
+// MediaSourceHandle.expo
+module.exports = {
+    linearSearch
+};