From 1d9861c4b69bfec72d271da74f06c2d6f37880ae Mon Sep 17 00:00:00 2001
From: Janitha133 <33251135+Janitha133@users.noreply.github.com>
Date: Sun, 20 Oct 2019 18:37:24 +0530
Subject: [PATCH] Add Java Linear Search-13(#181)

Related to #1
---
 README.md                                     |  1 +
 java-linear-search/java-linear-search-13.java | 24 +++++++++++++++++++
 2 files changed, 25 insertions(+)
 create mode 100644 java-linear-search/java-linear-search-13.java

diff --git a/README.md b/README.md
index e160705..85e1317 100755
--- a/README.md
+++ b/README.md
@@ -50,3 +50,4 @@ Linear search is a very simple search algorithm. In this type of search, a seque
 |37| [Ryan Smolik](https://github.com/ryansmolik03) | | |Java|
 |38| [Ciaran Evans](https://github.com/ciaranevans) | | UK | Lua |
 |39| [Balakumaran](https://github.com/webbalakumaran) | | India | Julia
+|40| [Janitha](https://github.com/janitha133) | | Sri Lanka | Java
diff --git a/java-linear-search/java-linear-search-13.java b/java-linear-search/java-linear-search-13.java
new file mode 100644
index 0000000..1a88270
--- /dev/null
+++ b/java-linear-search/java-linear-search-13.java
@@ -0,0 +1,24 @@
+import java.util.Scanner;
+
+public class LinearSearch {
+  public static void main(String[] args) {
+    Scanner input = new Scanner(System.in);
+    int n = input.nextInt();
+    int value = input.nextInt();
+    int[] array = new int[n];
+    for (int i = 0; i < n; i++) {
+      array[i] = input.nextInt();
+    }
+    linearSearch(n, array, value);
+  }
+
+  private static void linearSearch(int n, int[] array, int value) {
+    for (int i = 0; i < n; i++) {
+      if (array[i] == value) {
+        System.out.println(i);
+        return;
+      }
+    }
+    System.out.println("Not Found!");
+  }
+}