Hello all,

This is the ole reverse a string classroom assignment.

Recursion is soemthing I never quite understood till now but as I
perceive it, for a method to be considered recursive, it MUST have a
base case and a recursive step.

Fine, with this in mind, I wrote a simple program that reverses a word
that doesn't have a base step but it calls itself.  Would this be
considered by the formal defintion of recursion?

To me, I see the base step as implied by doing nothing while you
decrease the parameter by one when you call the method again and THEN
you stop calling it recusively when you get to the last element of the
string.  For example, consider the code:

   public class StringReversal {
      public static void main(String[] args) {

        String aWord = "hello";
        System.out.print ("\nReversing " + aWord + " to ");

        reversal(aWord,aWord.length()-1);

     }  // end main

      /**reverses a string of characters
       * @param string is the string passed */
      public static void reversal(String aWord,int position){

        System.out.print(aWord.substring(position,position+1));

        if (position != 0) {
           reversal(aWord,position-1);
        }
     }  // end Reversal method
  }

I have a feeling the professor is probably not going to like this
because it doesn't fit the 'model' recursion defintion...no base case
and recursive step defined.   I'm just wondering what other ppl
think.  It's clear to me and it works!  :p

Any thoughts appreciated.