title: How to recursively check for java array palindrome?
body: <p>I'm stuck on a java assignment wherein I'm asked to design a recursive palindrome method that checks an integer array, returns true if it is a palindrome, false if it is not. So far I know the base case is that if the array is empty, or if it has only one element, it returns true. But I'm not sure how to start with the rest. Please help! Thank you!
  This is what I have so far:</p>
  
  <pre><code>public boolean isPalindrome(int[] array, int start, int end)
  {
      if(array.length == 0 || array.length == 1)
          return true;
  
      if(start &gt;= end)
          return true;
  
      if(array[start] != array[end])
          return false;
  
      return palindrome(array, start + 1, end -1);
  }
  </code></pre>