From f4a2e785a3debf75db94b21fadf2d84abc594f05 Mon Sep 17 00:00:00 2001
From: Matthew Strapp <msattr@gmail.com>
Date: Sun, 14 Apr 2019 12:03:20 -0500
Subject: Start 6B (much easier than 6A)

---
 ee1301/wk6/dice.cpp                        | 178 -----------------------------
 ee1301/wk6/hw6_directory/dice.cpp          | 178 +++++++++++++++++++++++++++++
 ee1301/wk6/hw6_directory/strap012_HW6B.cpp |  29 +++++
 3 files changed, 207 insertions(+), 178 deletions(-)
 delete mode 100644 ee1301/wk6/dice.cpp
 create mode 100644 ee1301/wk6/hw6_directory/dice.cpp
 create mode 100644 ee1301/wk6/hw6_directory/strap012_HW6B.cpp

(limited to 'ee1301/wk6')

diff --git a/ee1301/wk6/dice.cpp b/ee1301/wk6/dice.cpp
deleted file mode 100644
index ebdb7d6..0000000
--- a/ee1301/wk6/dice.cpp
+++ /dev/null
@@ -1,178 +0,0 @@
-#include <iostream>
-#include <cstdlib>
-using namespace std;
-
-const int maxNumDie=50;
-
-int* userInputParser(string s);
-
-class Dice {
-private:
-  int min;
-  int max;
-
-public:
-//  void roll();
-};
-
-int main()
-{
-    srand(time(NULL)); // DO NOT WRITE THIS LINE AGAIN OR ANYWHERE ELSE
-    cout << "What do you want to roll?  ";
-    string s;
-    getline(cin, s);
-    cin.ignore();
-    cout << "How many rounds do you want to roll?";
-    cin >> rounds;
-    int* pairs = userInputParser(s);
-
-    // This will display the array of die information retrieved from user.
-    // Replace the following code when you submit your solution.
-
-    // pairs is an array with the following format:
-    // {num_dice,
-    //  first_die_start,
-    //  first_die_end,
-    //  second_die_start,
-    //  ... }
-    for(int i=1; i < pairs[0]; i+=2)
-    {
-        cout << "["<<pairs[i]<<","<<pairs[i+1]<<"]" << endl;
-    }
-}
-
-
-int* userInputParser(string s) {
-    static int dice[2*maxNumDie+1] = {0}; // array format:
-    // {num_dice,
-    //  first_die_start,
-    //  first_die_end,
-    //  second_die_start,
-    //  ... }
-    // max of maxNumDie dice supported
-
-    string data[4*maxNumDie];  // Intermediate storage for parsing input string
-
-    // count how many '+'s or 'd's there are...
-    int parts = 0;
-    for(int i=0; i < s.length(); i++)
-    {
-        if(s[i] == 'd' || s[i] == '+')
-        {
-            parts++;
-        }
-    }
-    // ... so we know the number of times to decode values
-
-    int index=0;
-    unsigned d = s.find('d');
-    unsigned p = s.find('+');
-    while(d != static_cast<unsigned>(-1) || p != static_cast<unsigned>(-1))
-    {
-        bool dFirst = d < p;
-        if(dFirst)
-        {
-            string before = s.substr(0,d); // part before the 'd' (should be just one number)
-            // figure out what number is after 'd'
-            int count = 0;
-            bool foundDigit=false;
-            for(int i=0; i< static_cast<signed>(s.length()-d-1); i++)
-            {
-                if(isdigit(s[count+d+1]))
-                {
-                    foundDigit=true;
-                }
-                if(!isdigit(s[count+d+1]) && foundDigit)
-                {
-                    break;
-                }
-                count++;
-            }
-            string after = s.substr(d+1,count); //should be just the number after 'd'
-
-            // store these two parts
-            data[index] = before;
-            data[index+1] = after;
-            index+=2;
-
-
-            // remove this part from the string s
-            s = s.substr(d+count+1); // discard these two parts
-        }
-        else // same idea for the '+'
-        {
-            // figure out what number is after '+'
-            int count = 0;
-            bool foundDigit=false;
-            for(int i=0; i< static_cast<signed>(s.length()-p-1); i++)
-            {
-                if(isdigit(s[count+p+1]))
-                {
-                    foundDigit=true;
-                }
-                if(!isdigit(s[count+p+1]) && foundDigit)
-                {
-                    break;
-                }
-                count++;
-            }
-            string after = s.substr(p+1,count); //should be just the number after '+'
-
-            // store this part
-            data[index] = "+";
-            data[index+1] = after;
-            index+=2;
-
-
-            // remove this part from the string s
-            s = s.substr(p+count+1); // discard these two parts
-        }
-
-        // update d and p for next loop interation
-        d = s.find('d');
-        p = s.find('+');
-
-    }
-
-    // now we need to figure out how many dice there are (as 2d4 is 2 dice)
-    // we will treat "+2" as a die that rolls [2,2]
-    int diceCount = 0;
-    for(int i=0; i < parts*2; i+=2)
-    {
-        if(data[i][0] == '+')
-        {
-            diceCount++;
-        }
-        else
-        {
-            diceCount+=atoi(data[i].c_str());
-        }
-    }
-
-    dice[0] = diceCount*2+1; // put size in first index
-
-    int ind=1; // index for the "dice" array (as not same as data array)
-    for(int i=0; i < parts*2; i+=2)
-    {
-        // if we have a +, add a "Dice" that has a range of 0
-        if(data[i][0] == '+')
-        {
-            dice[ind] = atoi(data[i+1].c_str());
-            dice[ind+1] = atoi(data[i+1].c_str());
-
-            ind+=2;
-        }
-        else // otherwise add however many of the dice requested
-        {
-            for(int j=0; j < atoi(data[i].c_str()); j++)
-            {
-                dice[ind] = 1;
-                dice[ind+1] = atoi(data[i+1].c_str());
-
-                ind += 2;
-            }
-        }
-    }
-
-    return dice;
-}
diff --git a/ee1301/wk6/hw6_directory/dice.cpp b/ee1301/wk6/hw6_directory/dice.cpp
new file mode 100644
index 0000000..ebdb7d6
--- /dev/null
+++ b/ee1301/wk6/hw6_directory/dice.cpp
@@ -0,0 +1,178 @@
+#include <iostream>
+#include <cstdlib>
+using namespace std;
+
+const int maxNumDie=50;
+
+int* userInputParser(string s);
+
+class Dice {
+private:
+  int min;
+  int max;
+
+public:
+//  void roll();
+};
+
+int main()
+{
+    srand(time(NULL)); // DO NOT WRITE THIS LINE AGAIN OR ANYWHERE ELSE
+    cout << "What do you want to roll?  ";
+    string s;
+    getline(cin, s);
+    cin.ignore();
+    cout << "How many rounds do you want to roll?";
+    cin >> rounds;
+    int* pairs = userInputParser(s);
+
+    // This will display the array of die information retrieved from user.
+    // Replace the following code when you submit your solution.
+
+    // pairs is an array with the following format:
+    // {num_dice,
+    //  first_die_start,
+    //  first_die_end,
+    //  second_die_start,
+    //  ... }
+    for(int i=1; i < pairs[0]; i+=2)
+    {
+        cout << "["<<pairs[i]<<","<<pairs[i+1]<<"]" << endl;
+    }
+}
+
+
+int* userInputParser(string s) {
+    static int dice[2*maxNumDie+1] = {0}; // array format:
+    // {num_dice,
+    //  first_die_start,
+    //  first_die_end,
+    //  second_die_start,
+    //  ... }
+    // max of maxNumDie dice supported
+
+    string data[4*maxNumDie];  // Intermediate storage for parsing input string
+
+    // count how many '+'s or 'd's there are...
+    int parts = 0;
+    for(int i=0; i < s.length(); i++)
+    {
+        if(s[i] == 'd' || s[i] == '+')
+        {
+            parts++;
+        }
+    }
+    // ... so we know the number of times to decode values
+
+    int index=0;
+    unsigned d = s.find('d');
+    unsigned p = s.find('+');
+    while(d != static_cast<unsigned>(-1) || p != static_cast<unsigned>(-1))
+    {
+        bool dFirst = d < p;
+        if(dFirst)
+        {
+            string before = s.substr(0,d); // part before the 'd' (should be just one number)
+            // figure out what number is after 'd'
+            int count = 0;
+            bool foundDigit=false;
+            for(int i=0; i< static_cast<signed>(s.length()-d-1); i++)
+            {
+                if(isdigit(s[count+d+1]))
+                {
+                    foundDigit=true;
+                }
+                if(!isdigit(s[count+d+1]) && foundDigit)
+                {
+                    break;
+                }
+                count++;
+            }
+            string after = s.substr(d+1,count); //should be just the number after 'd'
+
+            // store these two parts
+            data[index] = before;
+            data[index+1] = after;
+            index+=2;
+
+
+            // remove this part from the string s
+            s = s.substr(d+count+1); // discard these two parts
+        }
+        else // same idea for the '+'
+        {
+            // figure out what number is after '+'
+            int count = 0;
+            bool foundDigit=false;
+            for(int i=0; i< static_cast<signed>(s.length()-p-1); i++)
+            {
+                if(isdigit(s[count+p+1]))
+                {
+                    foundDigit=true;
+                }
+                if(!isdigit(s[count+p+1]) && foundDigit)
+                {
+                    break;
+                }
+                count++;
+            }
+            string after = s.substr(p+1,count); //should be just the number after '+'
+
+            // store this part
+            data[index] = "+";
+            data[index+1] = after;
+            index+=2;
+
+
+            // remove this part from the string s
+            s = s.substr(p+count+1); // discard these two parts
+        }
+
+        // update d and p for next loop interation
+        d = s.find('d');
+        p = s.find('+');
+
+    }
+
+    // now we need to figure out how many dice there are (as 2d4 is 2 dice)
+    // we will treat "+2" as a die that rolls [2,2]
+    int diceCount = 0;
+    for(int i=0; i < parts*2; i+=2)
+    {
+        if(data[i][0] == '+')
+        {
+            diceCount++;
+        }
+        else
+        {
+            diceCount+=atoi(data[i].c_str());
+        }
+    }
+
+    dice[0] = diceCount*2+1; // put size in first index
+
+    int ind=1; // index for the "dice" array (as not same as data array)
+    for(int i=0; i < parts*2; i+=2)
+    {
+        // if we have a +, add a "Dice" that has a range of 0
+        if(data[i][0] == '+')
+        {
+            dice[ind] = atoi(data[i+1].c_str());
+            dice[ind+1] = atoi(data[i+1].c_str());
+
+            ind+=2;
+        }
+        else // otherwise add however many of the dice requested
+        {
+            for(int j=0; j < atoi(data[i].c_str()); j++)
+            {
+                dice[ind] = 1;
+                dice[ind+1] = atoi(data[i+1].c_str());
+
+                ind += 2;
+            }
+        }
+    }
+
+    return dice;
+}
diff --git a/ee1301/wk6/hw6_directory/strap012_HW6B.cpp b/ee1301/wk6/hw6_directory/strap012_HW6B.cpp
new file mode 100644
index 0000000..5b15ca0
--- /dev/null
+++ b/ee1301/wk6/hw6_directory/strap012_HW6B.cpp
@@ -0,0 +1,29 @@
+#include <iostream>
+
+int ff(int x);
+
+int main() {
+  int value = -1;
+  do {
+  std::cout << "Please enter a value of x: ";
+    std::cin >> value;
+  } while (value<0);
+  std::cout << "Beginning calculation of ff(x)...\n";
+  int ffx = ff(value);
+  std::cout << "Calcuation complete, ff(x) = " << ffx << std::endl;
+}
+
+int ff(int x) {
+  if (x > 1) {
+    if (x%2 == 0) {
+      std::cout << "Calling ff(" << x/2 << ")\n";
+      return x*ff(x/2);
+    } else {
+      std::cout << "Calling ff(" << x-2 << ")\n";
+      return x*ff(x-2);
+    }
+  } else {
+    std::cout << "Returning from ff(" << x << ") = 1\n";
+    return 1;
+  }
+}
-- 
cgit v1.2.3