diff --git a/searching/README.md b/searching/README.md
index 66b19622..324b67bb 100644
--- a/searching/README.md
+++ b/searching/README.md
@@ -11,9 +11,12 @@
 1. [Linear Search](python/linear-search.py)
 2. [Binary Search](python/binary-search.py)
 
+### JavaScript
+
+1. [Linear Search](js/linear-search.js)
+
 ### Java
 
 1. [Linear Search](java/linear-search.java)
 
 
-
diff --git a/searching/js/linear-search.js b/searching/js/linear-search.js
new file mode 100644
index 00000000..434e218f
--- /dev/null
+++ b/searching/js/linear-search.js
@@ -0,0 +1,18 @@
+// Linear Search JavaScript Version: searches for a specific item in an array and returns the index of the item.
+
+function linearSearch(arr, x) {
+  // Loop through the array
+  for (let i = 0; i < arr.length; i++) {
+    // Checks if the item in the array = search item. If yes, return the index. If not, move to next item.
+    if (arr[i] === x) {
+      return i;
+    }
+  }
+  // After looping if the search item is not found, return -1.
+  return -1;
+}
+
+// Log to the console and have fun!
+console.log(linearSearch([2, 5, 8], 5));
+console.log(linearSearch([2, 6, 9, 15], 2));
+console.log(linearSearch([2, 3, 4, 10], 8));