Recursion by m.habib
Download as PPTX, PDF0 likes57 views
This Java program demonstrates recursion by defining a static method called test that takes an integer parameter i. The test method recursively calls itself, decrementing i each time, until i is less than 1. It then prints the current value of i before returning. When the main method calls test with an initial value of 4, it causes test to recursively call itself multiple times, decrementing i each iteration and printing the values, resulting in the output of the numbers 4 through 1 being printed multiple times.
1 of 1
Download to read offline
![public class Recursion
{
public static void main(String[] args)
{
int c=4;
test(c);
}
public static int test(int i)
{
if(i >=1)
{
test(i-1); Fun1
test(i-1); Fun2
System.out.println( i);
}
return 0;
}
} done
done
done
done
4
3
2
1
1
2
1
1
3
2
1
2
1
1
1
done
done
done](https://image.slidesharecdn.com/recursionbym-160517141733/85/Recursion-by-m-habib-1-320.jpg)
Recursion by m.habib
- 1. public class Recursion { public static void main(String[] args) { int c=4; test(c); } public static int test(int i) { if(i >=1) { test(i-1); Fun1 test(i-1); Fun2 System.out.println( i); } return 0; } } done done done done 4 3 2 1 1 2 1 1 3 2 1 2 1 1 1 done done done