A good answer might be:

  boolean equals( String strA, String strB )
  {
    if       ( strA.length() == 0 && strB.length() == 0 )
      return true;
      
    else if  ( strA.length() == 0 && strB.length() != 0 )
      return false;
      
    else if  ( strA.length() != 0 && strB.length() == 0 )
      return false;
      
    else if  ( strA.charAt(0) != strB.charAt(0) )
      return false;
      
    else
      return equals( strA.substring(1), strB.substring(1) );
  }

End of Chapter

You have reached the end this chapter. You may wish to review the following. Click on a subject that interests you to go to where it was discussed.

Pyramidal numbers.
Recursive definition of Pyramidal numbers.
Java method for Pyramidal numbers.
Activation chain for Pyramidal numbers.
Stack
String equality.

Back to the main menu.

You have reached the end of the chapter.