mycpp-projects/Recursion lab.cpp at master · CarsonV/mycpp-projects · 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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
//Carson Vance

#include "stdafx.h"
#include <iostream>


using namespace std;

int pow(int, int, int);
int factorial(int, int);
int fibonacci(int, int);
int collatz(int, int);

int _tmain(int argc, _TCHAR* argv[])
{
	int choice, input, exp, x;
	char qFlag;
	do
	{
		cout << "Chose choose one of the following programs" << endl;
		cout << "1.Powers" << endl;
		cout << "2.Factorials" << endl;
		cout << "3.Fibonacci" << endl;
		cout << "4.Collatz" << endl;
		cout << "5.Quit" << endl;
		cin >> choice;

		do
		{
			switch (choice)
			{
			case 1:
				cout << "Base #: ";
				cin >> input;
				cout << "Exponent #: ";
				cin >> exp;
				x = pow(input, exp, 0);
				cout << x << endl;
				cout << "quit(y/n)";
				cin >> qFlag;
				break;

			case 2:
				cout << "Base #: ";
				cin >> input;
				x = factorial(input, 0);
				cout << x << endl;
				cout << "quit(y/n)";
				cin >> qFlag;
				break;

			case 3:
				cout << "Base #: ";
				cin >> input;
				x = fibonacci(input, 0);
				cout << "Answer is: " << x << endl;
				cout << "quit(y/n)";
				cin >> qFlag;
				break;

			case 4:
				cout << "Base #: ";
				cin >> input;
				x = collatz(input, 0);
				cout << "Answer is :" << x << endl;
				cout << "quit(y/n)";
				cin >> qFlag;
				break;

			case 5:
				qFlag = 'y';
				break;

			}

		} while (qFlag != 'y');
		system("cls");
	} while (choice != 5);


	return 0;
}
int pow(int num, int exp, int level)
{
	level++;
	for (int i = 1; i < level * 2; i++)
	{
		cout << " ";
	}
	cout << "At depth " << level << endl;

	if (exp == 1)
		return num;
	//cout << level << endl;
	return num *= pow(num, exp - 1, level);
}
int factorial(int input, int level)
{
	level++;
	for (int i = 1; i < level * 2; i++)
	{
		cout << " ";
	}
	cout << "At depth " << level << endl;

	if (input == 1)
		return input;
	return input * factorial(input - 1,level);
}
int fibonacci(int num, int level)
{
	level++;
	for (int i = 1; i < level * 2; i++)
	{
		cout << " ";
	}
	cout << "At depth " << level << endl;

	if (num == 1)
		return 0;
	if (num == 2)
		return 1;
	cout << num << endl;
	return fibonacci(num - 1,level) + fibonacci(num - 2,level);
}
int collatz(int num, int level)
{
	level++;
	for (int i = 1; i < level * 2; i++)
	{
		cout << " ";
	}
	cout << "At depth " << level << endl;
	cout << num << endl;
	if (num == 1)
		return 1;
	if (num % 2 == 0)
		return collatz(num / 2, level);
	if (num % 2 != 0)
		return collatz(3 * num + 1, level);


}