Parvin Etibarli Java

 

1. Factorial: package main.lesson5; public class Main { public static void main (String[] args) { System. out .println( factorial ( 5 )); System. out .println( factorial2 ( 5 )); } public static int factorial ( int n) { if (n == 0 ) return 1 ; return n * factorial (n - 1 ); } public static int factorial2 ( int n) { int currentValue = n; if (currentValue == 0 ) { return 1 ; } int previousValue = currentValue - 1 ; int recursiveResult = factorial (previousValue); int result = currentValue * recursiveResult; return result; } }   2. Fibonacci: package main.lesson5; public class Main { public static void main (String[] args) { System. out .println( fibonacci ( 6 )); } public static int fibonacci ( int n) { if (n == 0 || n == 1 ) return n; return fibonacci (n - 1 ) + fibonacci (n - 2 ); } public static int fibonacci2 ( int n)