aboutsummaryrefslogtreecommitdiffstats
path: root/ee1301/wk6/hw6_directory/strap012_HW6B.cpp
diff options
context:
space:
mode:
authorRossTheRoss <msattr@gmail.com>2019-06-25 17:55:13 -0500
committerRossTheRoss <msattr@gmail.com>2019-06-25 17:55:13 -0500
commit6c83506cb44b1d20f66df404f0b6468b0e291b6b (patch)
tree8e0475edc2891741862bc9b63844600bdebe6936 /ee1301/wk6/hw6_directory/strap012_HW6B.cpp
parentM E A N I N G F U L C O M M E N T S (diff)
downloadhomework-6c83506cb44b1d20f66df404f0b6468b0e291b6b.tar
homework-6c83506cb44b1d20f66df404f0b6468b0e291b6b.tar.gz
homework-6c83506cb44b1d20f66df404f0b6468b0e291b6b.tar.bz2
homework-6c83506cb44b1d20f66df404f0b6468b0e291b6b.tar.lz
homework-6c83506cb44b1d20f66df404f0b6468b0e291b6b.tar.xz
homework-6c83506cb44b1d20f66df404f0b6468b0e291b6b.tar.zst
homework-6c83506cb44b1d20f66df404f0b6468b0e291b6b.zip
Do a thing:
Diffstat (limited to 'ee1301/wk6/hw6_directory/strap012_HW6B.cpp')
-rw-r--r--ee1301/wk6/hw6_directory/strap012_HW6B.cpp68
1 files changed, 34 insertions, 34 deletions
diff --git a/ee1301/wk6/hw6_directory/strap012_HW6B.cpp b/ee1301/wk6/hw6_directory/strap012_HW6B.cpp
index 87ba640..a845e45 100644
--- a/ee1301/wk6/hw6_directory/strap012_HW6B.cpp
+++ b/ee1301/wk6/hw6_directory/strap012_HW6B.cpp
@@ -1,34 +1,34 @@
-//Matthew Strapp
-//EE1301
-//17 April 2019
-//HW 6B: Recursion and ff(x)
-#include <iostream>
-
-int ff(int x);
-int main() {
- int x;
- do {
- std::cout << "Please enter a value of x: ";
- std::cin >> x;
- } while (x<0);
- std::cout << "Beginning calculation of ff(x)...\n";
- std::cout << "Calcuation complete, ff(x) = " << ff(x) << std::endl;
-}
-
-// This function either returns 1 when x is one of two recrusive conditions depending on if x is even or odd.
-int ff(int x) {
- if (x > 1) {
- if (x%2 == 0) {
- // x is even
- std::cout << "Calling ff(" << x/2 << ")\n";
- return x*ff(x/2);
- } else {
- // x is odd but not 1
- std::cout << "Calling ff(" << x-2 << ")\n";
- return x*ff(x-2);
- }
- } else {
- // x is 1 (or 0)
- return 1;
- }
-}
+//Matthew Strapp
+//EE1301
+//17 April 2019
+//HW 6B: Recursion and ff(x)
+#include <iostream>
+
+int ff(int x);
+int main() {
+ int x;
+ do {
+ std::cout << "Please enter a value of x: ";
+ std::cin >> x;
+ } while (x<0);
+ std::cout << "Beginning calculation of ff(x)...\n";
+ std::cout << "Calcuation complete, ff(x) = " << ff(x) << std::endl;
+}
+
+// This function either returns 1 when x is one of two recrusive conditions depending on if x is even or odd.
+int ff(int x) {
+ if (x > 1) {
+ if (x%2 == 0) {
+ // x is even
+ std::cout << "Calling ff(" << x/2 << ")\n";
+ return x*ff(x/2);
+ } else {
+ // x is odd but not 1
+ std::cout << "Calling ff(" << x-2 << ")\n";
+ return x*ff(x-2);
+ }
+ } else {
+ // x is 1 (or 0)
+ return 1;
+ }
+}