Added JS Sols for Lin & Bin Search

Author: smv1999

Searching Algorithms/binary_search.js

@@ -0,0 +1,17 @@
+var n = 5,
+  k = 5;
+var arr = [1, 2, 3, 4, 5];
+
+console.log(binarySearch(arr, n, k));
+
+function binarySearch(arr, n, k) {
+  var first = 0,
+    last = n - 1;
+  while (first <= last) {
+    var mid = Math.floor((first + last) / 2);
+    if (arr[mid] === k) return mid;
+    else if (arr[mid] > k) last = mid - 1;
+    else if (arr[mid] < k) first = mid + 1;
+  }
+  return -1;
+}

Searching Algorithms/linear_search.js

@@ -0,0 +1,12 @@
+var n = 5,
+  k = 5;
+var arr = [1, 2, 3, 4, 5];
+
+console.log(linearSearch(arr, n, k));
+
+function linearSearch(arr, n, k) {
+  for (var index = 0; index < n; index++) {
+    if (arr[index] == k) return index;
+  }
+  return -1;
+}