java recursion example

Agree with what Doug says, but most people start with factorial demonstration, as that is quite well known, whereas Fibonacci is a little more intricate. So here is a simple factorial recursion.

class Recur {

public static void main(String[] args){

Recur recur = new Recur();

System.out.println(recur.recurer(10));

}

static int recurer(int i){

		System.out.println(i==1?" . . . being called for the last time":" - > Call number "+(10-i+1)+".");

		if (i <= 1) {
	      return 1;
		}
	
	return i * recurer(i-1);
}


}

Select allOpen in new window

https://howtoprogramwithjava.com/java-recursion/

Actually, the code you are quoting has an index output error - line 23, as it stands in the original, should be transported up to line 5, otherwise the indexes are not printed sequentially.

Line 23 fyi, is

index++;

Select allOpen in new window

i wonder how and where n2 gets incremented

fibonacciSequence(n2, n1+n2);  
// but it's not incremented because it is passed to a different n2