Is this the most efficient way of doing recursion for checking whether a string is a palindrome?
<pre><code>public boolean isPalindrome3(String input, int index, int length)
{
    if(index &gt; (length-1-index))
        return true;

    else if(input.charAt(index)!=input.charAt(length-1-index))
        return false;

    else
        return isPalindrome3(input, index + 1, length);



}
</code></pre>

<p>Here initially i pass the input string, 0, input.length() </p>
