diff --git a/Search/LinearSearch b/Search/LinearSearch
new file mode 100644
index 0000000..30703f2
--- /dev/null
+++ b/Search/LinearSearch
@@ -0,0 +1,33 @@
+import java.util.Scanner;  
+   
+class LinearSearchExample2   
+{  
+  public static void main(String args[])  
+  {  
+    int c, n, search, array[];  
+   
+    Scanner in = new Scanner(System.in);  
+    System.out.println("Enter number of elements");  
+    n = in.nextInt();   
+    array = new int[n];  
+   
+    System.out.println("Enter those " + n + " elements");  
+   
+    for (c = 0; c < n; c++)  
+      array[c] = in.nextInt();  
+   
+    System.out.println("Enter value to find");  
+    search = in.nextInt();  
+   
+    for (c = 0; c < n; c++)  
+    {  
+      if (array[c] == search)     /* Searching element is present */  
+      {  
+         System.out.println(search + " is present at location " + (c + 1) + ".");  
+          break;  
+      }  
+   }  
+   if (c == n)  /* Element to search isn't present */  
+      System.out.println(search + " isn't present in array.");  
+  }  
+}