Example Recursion in Java #1
The recursive function below will produce the nth Fibonacci number.
public class Recursion {
public int getNthFibonacci( int n )
{
if ( n == 1 || n == 2 )
return 1;
else
return getNthFibonacci( n-1 ) + getNthFibonacci( n-2 );
}
public static void main(String[] args){
Recursion myRecursor = new Recursion();
System.out.println( myRecursor.getNthFibonacci(5) );
}
}
Reversing a String with Recursion
import java.util.Scanner;
public class StringRecursion{
public static void main (String[] args){
Scanner scan = new Scanner (System.in);
System.out.println("Enter text to reverse: ");
String s = scan.nextLine();
reverseString(s);
}
public static void reverseString(String s){
if (s.length() <=1){
System.out.print(s);
}
else{
reverseString (s.substring(1, s.length()));
System.out.print(s.substring(0,1));
}
}
}