Temel-Java-Ornekleri/Recursion at master · furkanyunkul/Temel-Java-Ornekleri · 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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scanner=new Scanner(System.in);
		System.out.println("sayi");
		int sayi=scanner.nextInt();

		System.out.println("Loop yönetemi ile");
		loopPrintStars(sayi);
		System.out.println("");
		System.out.println("----------------");
		System.out.println("Recursion ile");
		recursionPrintStars(sayi);
		System.out.println("Loop yönetemi ile faktoriel");
		System.out.println(loopFactoriel(sayi));
		System.out.println("Recursion yönetemi ile faktoriel");
		System.out.println(recursionFaktoriel(sayi));
		System.out.println("Loop yönetemi ile fibonacci");
		System.out.println(fibonacci(sayi));
		System.out.println("Recursion yönetemi ile fibonacci");
		System.out.println(recursionFibonacci(sayi));
		System.out.println("Recursion myster");
		int n=648;
		System.out.println(myster(n));
		System.out.println(myster2(n));
	}

	public static void loopPrintStars(int n) {
		for(int i=0;i<n;i++) {
			System.out.print("*");
		}
	}
	/*Recursion yöntem 1*/
	public static void recursionPrintStars(int n) {
		if(n==1) {
			System.out.println("*");
		}
		else {
			System.out.print("*");
			recursionPrintStars(n-1);
		}
	}
	/*Recursion yöntem 1*/
	public static void recursionPrintStarsV2(int n) {
		if(n==0) {
			System.out.println();
		}
		else {
			System.out.print("*");
			recursionPrintStars(n-1);
		}
	}

	public static int loopFactoriel(int n) {
		int factoriel=1;
		for(int i=1;i<=n;i++) {
			factoriel=factoriel*i;
		}
		return factoriel;
	}

	public static int recursionFaktoriel(int n) {
		if(n==0) {
			return(1);
		}
		else {
			return(n*recursionFaktoriel(n-1));
		}
	}

	public static int fibonacci(int n) {
		if(n==0 || n==1) {
			return n;
		}
		else {
			int p1=0;
			int p2=1;
			int temp=0;
			for(int i=2;i<=n;i++) {
				temp=p1+p2;
				p1=p2;
				p2=temp;
			}
			return p2;
		}
	}

	public static int recursionFibonacci(int n) {
		if(n<2) {
			return n;
		}
		else {
			return (recursionFibonacci(n-2)+recursionFibonacci(n-1));
		}
	}

	public static int myster(int n) {
		if(n<10) {
			return n;
		}else {
			int a=n/10;
			int b=n%10;
			return myster(a+b);
		}
	}

	public static int myster2(int n) {
		if(n<10) {
			return(10*n)+n;
		}
		else {
			int a=myster2(n/10);
			int b=myster2(n%10);
			return (100*a)+b;
		}
	}

}