Posts

2_code_fibonacci | recursion

 public class fibonacci {     public static void fibonacci(int a, int b, int n){         if(n==0){             return;         }  int c=a+b;         System.out.println(c);         fibonacci(b,c,n-1);     }     public static void main(String args[]){         int a=0, b=1;         int n=7;         System.out.println(a);         System.out.println(b);         fibonacci(a,b,n-2);     } }
Post a Comment
Read more

1_code_factorial_recursion

  public class factorial { public factorial () { } public static int factono ( int n) { if (n != 1 && n != 0 ) { int fact1 = factono (n - 1 ) ; int factn = n * fact1 ; return factn ; } else { return 1 ; } } public static void main (String[] args) { int n = 5 ; int ans = factono (n) ; System. out .println(ans) ; } }
Post a Comment
Read more