Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class RecursionHomeWork {
- public static void main(String[] args) {
- System.out.println(fact(5));
- System.out.println(recursionCount(5));
- System.out.println(recursionCount2(4));
- System.out.println(fibonachi(5));
- }
- public static int fact(int num) {
- if (num == 0) {
- return 1;
- }
- int count = 1;
- while (num > count) {
- count++;
- }
- return num * fact(num - 1);
- }
- public static int recursionCount(int n) {
- if (n == 1) {
- return 1;
- }
- System.out.print(n + " "); //Не понимаю почем без sout не выводится, хотя в main же и так через sout??
- return recursionCount(n - 1);
- }
- public static String recursionCount2(int n) { //Не понял почему тут String???
- if (n == 1) {
- return "1";
- }
- return recursionCount2(n - 1) + " " + n;
- }
- public static int fibonachi(int num) {
- if (num == 1) {
- return 0;
- }
- if (num == 2) {
- return 1;
- } else {
- return fibonachi(num - 1) + fibonachi(num - 2);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement