From d88c04f5ee72ec3d131050eccf1edd588b761ec8 Mon Sep 17 00:00:00 2001
From: Mohit Sharma <mohit1532.cse16@chitkara.edu.in>
Date: Thu, 17 Aug 2017 11:08:36 +0530
Subject: [PATCH 1/2] Added Implementation of Linear Search

---
 Search/linearSearch.js | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)
 create mode 100644 Search/linearSearch.js

diff --git a/Search/linearSearch.js b/Search/linearSearch.js
new file mode 100644
index 000000000..5d517f22c
--- /dev/null
+++ b/Search/linearSearch.js
@@ -0,0 +1,21 @@
+function SearchArray(searchNum, ar) {
+  var position = Search(ar, searchNum);
+  if (position != -1) {
+    console.log("The element was found at " + (position + 1));
+  } else {
+    console.log("The element not found");
+  }
+}
+
+// Search “theArray” for the specified “key” value
+function Search(theArray, key) {
+  for (var n = 0; n < theArray.length; n++)
+    if (theArray[n] == key)
+      return n;
+  return -1;
+}
+
+var ar = [1, 2, 3, 4, 5, 6, 7, 8, 9];
+SearchArray(3, ar);
+SearchArray(4, ar);
+SearchArray(11, ar);

From adbd6d7ca957b05b928973f03a20393054653aac Mon Sep 17 00:00:00 2001
From: Mohit Sharma <mohit1532.cse16@chitkara.edu.in>
Date: Thu, 17 Aug 2017 11:10:10 +0530
Subject: [PATCH 2/2] Update linearSearch.js

---
 Search/linearSearch.js | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/Search/linearSearch.js b/Search/linearSearch.js
index 5d517f22c..19556e08b 100644
--- a/Search/linearSearch.js
+++ b/Search/linearSearch.js
@@ -1,3 +1,9 @@
+/*
+* Linear search or sequential search is a method for finding a target
+* value within a list. It sequentially checks each element of the list
+* for the target value until a match is found or until all the elements
+* have been searched.
+*/
 function SearchArray(searchNum, ar) {
   var position = Search(ar, searchNum);
   if (position != -1) {