Java_Basi/recurse.java at main · nikhilritgithub/Java_Basi · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
public class recurse {

    public static void printInc(int n){
      if(n==1){
        System.out.print(n+ " ");
        return;
      }

        printInc(n-1);
        System.out.print(n+ " ");
    }


    public static void printDec(int n){

       if(n==1){
        System.out.print(n+ "" );
        return;
       }

        System.out.print(n+ " ");
        printDec(n-1);
    }


    public static int fact(int n){
      if(n==1){
        return 1;
      }
      int fnm1 = fact(n-1);
      int fn = n * fact(n-1);
      return fn;
      }


      public static int sum(int n){
        if(n==1){
          return 1;
        }

        int fnm1 = sum(n-1);
        int fn = n + sum(n-1);
        return fn;
       }


       public static int fib(int n){
        if(n==0 || n==1){
          return n;
        }

        int fnm1 = fib(n-1);
        int fnm2 = fib(n-2);
        return fnm1 + fnm2;
       }

    public static void main(String args[]){
    int n = 10;
       printInc(n);
       printDec(n);
       System.out.println(fact(5));
       System.out.println(sum(5));
       System.out.println(fib(n));
    }
}