src/Recursion/recursion1.java
public static boolean isSorted(int[] arr, int n) {

		if (n == 0) {
			return true;
		}

		if (isSorted(arr, n - 1)) {
			if (arr[n - 1] < arr[n])
				return true;
		}

		return false;

	}
//	check if array is Sorted using recursion
check if array is Sorted using recursion
check if array is Sorted using recursion
public static boolean isSorted(int[] arr, int n) {
		if (n == 0) {
			return true;
		}
		if (isSorted(arr, n - 1)) {
			if (arr[n - 1] < arr[n])
				return true;
		}
		return false;
	}
public static boolean isSorted ( int [ ] arr , int n ) { if ( n == 0 ) { return true ; } if ( isSorted ( arr , n - 1 ) ) { if ( arr [ n - 1 ] < arr [ n ] ) return true ; } return false ; }
check if array is Sorted using recursion
check if array is Sorted using recursion