pradeepkumar24rk
diff --git a/‎Recursion/Sorted.java
Copy file name to clipboard
+24Lines changed: 24 additions & 0 deletions b/‎Recursion/Sorted.java
Copy file name to clipboard
+24Lines changed: 24 additions & 0 deletions
diff --git a/‎SearchingAlgorithm/LinearSearch.java
Copy file name to clipboardExpand all lines: SearchingAlgorithm/LinearSearch.java
+31-2Lines changed: 31 additions & 2 deletions b/‎SearchingAlgorithm/LinearSearch.java
Copy file name to clipboardExpand all lines: SearchingAlgorithm/LinearSearch.java
+31-2Lines changed: 31 additions & 2 deletions
@@ -0,0 +1,24 @@
+package Recursion;
+
+public class Sorted {
+
+    static boolean isSorted(int[] arr, int n, int first, int second) {       //optimized
+        if(n<0)
+            return true;
+        if(arr[first]>arr[second])
+            return false;
+        return isSorted(arr, n-1, first+1, second+1);
+    }
+    
+    static boolean issorted(int[] arr,int index) {
+        if(index==arr.length-1)
+            return true;
+        return arr[index]<=arr[index+1] && issorted(arr, index+1);
+    }
+    public static void main(String[] args) {
+        int arr[] = {2,6,8,8}, n = arr.length;
+        System.out.println(isSorted(arr,n-2,0,1));
+        System.out.println(issorted(arr, 0));
+    }
+}
+ 
@@ -10,10 +10,39 @@ static String linearSearch(int a[],int n,int t){
                 return "Founded";
         return "NotFounded";
     }
+    
+    static boolean recursiveLinearSearch(int a[],int index, int target) {
+        if(index == a.length-1)
+            return false;
+        return a[index]==target || recursiveLinearSearch(a, index+1, target);
+    }
+    
+    
+    //Example a[] = {1,23,5,5,10}
+    static int recursiveLinearSearchForward(int a[],int index, int target) {
+        if(index == a.length-1)
+            return -1;
+        if(a[index]==target)
+            return index;
+        return recursiveLinearSearchForward(a, index+1, target);
+    } //it return index as 2
+    static int recursiveLinearSearchBackward(int a[],int index, int target) {
+        if(index == -1)
+            return -1;
+        if(a[index]==target)
+            return index;
+        return recursiveLinearSearchBackward(a, index-1, target);
+    } //it return index as 3
+    
+    // if we have multiple occurs in search array if you need two value index added in the new array list
+    
     public static void main(String[] args) {
-        int a[]={11,3,55,6,7,355,77};
-        int target=15;
+        int a[]={11,3,55,55,6,7,355,77};
+        int target=55;
         int n=a.length;
         System.out.println(linearSearch(a,n,target));
+        System.out.println(recursiveLinearSearch(a,0,target));
+        System.out.println(recursiveLinearSearchForward(a,0,target));
+        System.out.println(recursiveLinearSearchBackward(a,n-1,target));
     }
 }