-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathARuizLab8.cpp
More file actions
139 lines (90 loc) · 1.99 KB
/
ARuizLab8.cpp
File metadata and controls
139 lines (90 loc) · 1.99 KB
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
//anthony ruiz
//CPSC 121 lab 8
// 04/06/19
#include<iostream>
#include<string>
using namespace std;
int main()
{
int factorial(int);
int factor(int, int);
string ObliterateString(string );
int option;
int number;
string word;
cout<< "which function would you like to access?\n";
cout<< "(1) Factorial\n(2) Factor\n(3) Obliterate String\n";
cin>> option;
if (option == 1)
{
cout << "What number would you like the factorial of?\n";
cin >> number;
cout << "\nThe factorial of "<< number << " is ";
cout << factorial(number);
cout <<endl;
}
if (option == 2)
{
cout<< "what number would you like to display the prime factors of?\n";
cin >> number;
cout << '\n' << factor(number, 2)<< endl;
}
if (option == 3)
{
cout << "what word would you like to obliterate?\n";
cin >> word;
cout << endl;
ObliterateString(word);
}
return 0;
}
/******************************************************************************
begining of function defenitions
******************************************************************************/
//factorial
int factorial(int n)//n will be input number
{
if (n == 1)//base case
{
return n;
}
else if ( n > 0)
{
return n * factorial(n-1);//recursive case
}
}
//obliterarate string
string ObliterateString(string word)
{
if ( word.length() == 0)
{
cout << "No string to obliterate.";
}
else
{
cout << word << endl;
word.pop_back();
return ObliterateString(word);
}
}
//factor funtion
int factor(int number, int i)
{
if(number != 0)
{
while (i < number)
{
if (number%i == 0)
{
cout<< i << " is a prime factor of " << number<< endl;
i++;
return factor(number, i);
}
}
}
else if (number == 0)
{
cout << number<< " as input is not valid";
return 0;
}
}