diff --git a/Linear-Search-master.zip b/Linear-Search-master.zip
new file mode 100644
index 0000000..a30b1b5
Binary files /dev/null and b/Linear-Search-master.zip differ
diff --git a/java-linear-search/LinearSearchExample.java b/java-linear-search/LinearSearchExample.java
new file mode 100644
index 0000000..a540431
--- /dev/null
+++ b/java-linear-search/LinearSearchExample.java
@@ -0,0 +1,15 @@
+    public class LinearSearchExample{    
+    public static int linearSearch(int[] arr, int key){    
+            for(int i=0;i<arr.length;i++){    
+                if(arr[i] == key){    
+                    return i;    
+                }    
+            }    
+            return -1;    
+        }    
+        public static void main(String a[]){    
+            int[] a1= {10,20,30,50,70,90};    
+            int key = 50;    
+            System.out.println(key+" is found at index: "+linearSearch(a1, key));    
+        }    
+    }    
\ No newline at end of file
diff --git a/java-linear-search/README.md b/java-linear-search/README.md
index 12728f9..64b5c17 100644
--- a/java-linear-search/README.md
+++ b/java-linear-search/README.md
@@ -12,3 +12,12 @@
 
 # java-linear-search-3
 <i>Easily understandable implementation</i>
+
+# LimearScerchExample
+<ol>
+<li>Easy code</li>
+<li>You will clearly understand</li>
+</ol>
+
+
+