From 7ed425ed3adb374368946790f82d41e6d5a4081e Mon Sep 17 00:00:00 2001
From: ak4522912 <31154526+ak4522912@users.noreply.github.com>
Date: Sat, 26 May 2018 03:13:50 +0530
Subject: [PATCH] Added Linear Search (#20)

Added algorithm for the basic and useful linear search
---
 src/algorithms/search/linear-search/Readme.md       | 7 +++++++
 src/algorithms/search/linear-search/linearsearch.js | 7 +++++++
 2 files changed, 14 insertions(+)
 create mode 100644 src/algorithms/search/linear-search/Readme.md
 create mode 100644 src/algorithms/search/linear-search/linearsearch.js

diff --git a/src/algorithms/search/linear-search/Readme.md b/src/algorithms/search/linear-search/Readme.md
new file mode 100644
index 000000000..87018520c
--- /dev/null
+++ b/src/algorithms/search/linear-search/Readme.md
@@ -0,0 +1,7 @@
+#Linear Search
+In computer science, 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.
+Linear search runs in at worst linear time and makes at most n comparisons, where n is the length of the list. 
+
+##References-
+-[Wikipedia] https://en.wikipedia.org/wiki/Linear_search
+-[Youtube] https://www.youtube.com/watch?v=SGU9duLE30w
diff --git a/src/algorithms/search/linear-search/linearsearch.js b/src/algorithms/search/linear-search/linearsearch.js
new file mode 100644
index 000000000..d4be5a2b0
--- /dev/null
+++ b/src/algorithms/search/linear-search/linearsearch.js
@@ -0,0 +1,7 @@
+function linearSearch(array, Find){
+  for(let i = 0; i < array.length; i++){
+    if(array[i] === Find) return i;
+    
+  }
+   return -1;
+}