src/Recursion/recursion2.java
public static boolean isPalindrome(int[] arr, int l, int r) {
		if (l > r) {
			return true;
		}

		if (arr[l] != arr[r]) {
			return false;
		}

		return isPalindrome(arr, l + 1, r - 1);

	}
//	check if the array is palindromic or not
check if the array is palindromic or not
check if the array is palindromic or not
public static boolean isPalindrome(int[] arr, int l, int r) {
		if (l > r) {
			return true;
		}
		if (arr[l] != arr[r]) {
			return false;
		}
		return isPalindrome(arr, l + 1, r - 1);
	}
public static boolean isPalindrome ( int [ ] arr , int l , int r ) { if ( l > r ) { return true ; } if ( arr [ l ] != arr [ r ] ) { return false ; } return isPalindrome ( arr , l + 1 , r - 1 ) ; }
check if the array is palindromic or not
check if the array is palindromic or not