Merge pull request #169 from MSufiyanAG/master

linear search in java #12

Java/Linear_search.java

@@ -0,0 +1,19 @@
+public class Linear_search {
+    //It iterates through the array to find key .The average time complexity O(n).
+    static int linsearch(int[] a,int k,int length){
+        for(int i=0;i<length;i++){
+            if(a[i]==k)
+                return i+1;//returns position
+        }
+        return -1;//returns -1 if not found
+    }
+    public static void main(String[] args){
+        int[] a={2,7,8,9,1,5,3,4};
+        int key=8;
+        System.out.println(linsearch(a,key,8));
+    }
+}
+/*
+output:
+3
+*/

Java/README.md

@@ -13,6 +13,7 @@
 * [Segment Tree](SegmentTree.java)
 
 ## Searching
+* [Linear Search](Linear_search.java)
 * [Binary Search](Binary_search.java)
 
 ## Sorting