Merge pull request #17 from tsolakoua/add-cpp-programs

Add rest of cpp programs

Author: juanjux

fixtures/bench_accumulator_factory.cpp

@@ -0,0 +1,57 @@
+#include <iostream>
+ 
+class Acc
+{
+public:
+    Acc(int init)
+        : _type(intType)
+        , _intVal(init)
+    {}
+ 
+    Acc(float init)
+        : _type(floatType)
+        , _floatVal(init)
+    {}
+ 
+    int operator()(int x)
+    {
+        if( _type == intType )
+        {
+            _intVal += x;
+            return _intVal;
+        }
+        else
+        {
+            _floatVal += x;
+            return static_cast<int>(_floatVal);
+        }
+    }
+ 
+    float operator()(float x)
+    {
+        if( _type == intType )
+        {
+            _floatVal = _intVal + x;
+            _type = floatType;
+            return _floatVal;
+        }
+        else
+        {
+            _floatVal += x;
+            return _floatVal;
+        }
+    }
+private:
+    enum {floatType, intType} _type;
+    float _floatVal;
+    int _intVal;
+};
+ 
+int main()
+{
+    Acc a(1);
+    a(5);
+    Acc(3);
+    std::cout << a(2.3f);
+    return 0;
+}

fixtures/bench_binary_search.cpp

@@ -0,0 +1,15 @@
+template <class T>
+int binSearch(const T arr[], int len, T what) {
+  int low = 0;
+  int high = len - 1;
+  while (low <= high) {
+    int mid = (low + high) / 2;
+    if (arr[mid] > what)
+      high = mid - 1;
+    else if (arr[mid] < what)
+      low = mid + 1;
+    else
+      return mid;
+  }
+  return -1; // indicate not found 
+}

fixtures/bench_fibonacci.cpp

@@ -0,0 +1,16 @@
+#include <iostream>
+ 
+int main()
+{
+        unsigned int a = 1, b = 1;
+        unsigned int target = 48;
+        for(unsigned int n = 3; n <= target; ++n)
+        {
+                unsigned int fib = a + b;
+                std::cout << "F("<< n << ") = " << fib << std::endl;
+                a = b;
+                b = fib;
+        }
+ 
+        return 0;
+}

fixtures/bench_fizzbuzz.cpp

@@ -0,0 +1,19 @@
+#include <iostream>
+using namespace std;
+ 
+int main()
+{
+  for (int i = 0; i <= 100; ++i)
+  {
+    bool fizz = (i % 3) == 0;
+    bool buzz = (i % 5) == 0;
+    if (fizz)
+      cout << "Fizz";
+    if (buzz)
+      cout << "Buzz";
+    if (!fizz && !buzz)
+      cout << i;
+    cout << "\n";
+  }
+  return 0;
+}

fixtures/bench_gcd.cpp

@@ -0,0 +1,24 @@
+static void Main(string[] args)
+{
+	Console.WriteLine("GCD of {0} and {1} is {2}", 1, 1, gcd(1, 1));
+	Console.WriteLine("GCD of {0} and {1} is {2}", 1, 10, gcd(1, 10));
+	Console.WriteLine("GCD of {0} and {1} is {2}", 10, 100, gcd(10, 100));
+	Console.WriteLine("GCD of {0} and {1} is {2}", 5, 50, gcd(5, 50));
+	Console.WriteLine("GCD of {0} and {1} is {2}", 8, 24, gcd(8, 24));
+	Console.WriteLine("GCD of {0} and {1} is {2}", 36, 17, gcd(36, 17));
+	Console.WriteLine("GCD of {0} and {1} is {2}", 36, 18, gcd(36, 18));
+	Console.WriteLine("GCD of {0} and {1} is {2}", 36, 19, gcd(36, 19));
+	for (int x = 1; x < 36; x++)
+	{
+		Console.WriteLine("GCD of {0} and {1} is {2}", 36, x, gcd(36, x));
+	}
+	Console.Read();
+}
+ 
+// Greatest Common Denominator using Euclidian Algorithm
+// Gist: https://gist.github.com/SecretDeveloper/6c426f8993873f1a05f7
+static int gcd(int a, int b)
+{	
+	return b==0 ? a : gcd(b, a % b);
+}
+ 

fixtures/bench_happy_numbers.cpp

@@ -0,0 +1,41 @@
+unsigned int happy_iteration(unsigned int n)
+{
+  unsigned int result = 0;
+  while (n > 0)
+  {
+    unsigned int lastdig = n % 10;
+    result += lastdig*lastdig;
+    n /= 10;
+  }
+  return result;
+}
+ 
+bool is_happy(unsigned int n)
+{
+  unsigned int n2 = happy_iteration(n);
+  while (n != n2)
+  {
+    n = happy_iteration(n);
+    n2 = happy_iteration(happy_iteration(n2));
+  }
+  return n == 1;
+}
+ 
+#include <iostream>
+ 
+int main()
+{
+  unsigned int current_number = 1;
+ 
+  unsigned int happy_count = 0;
+  while (happy_count != 8)
+  {
+    if (is_happy(current_number))
+    {
+      std::cout << current_number << " ";
+      ++happy_count;
+    }
+    ++current_number;
+  }
+  std::cout << std::endl;
+}

fixtures/bench_hundred_doors.cpp

@@ -0,0 +1,17 @@
+#include <iostream>
+ 
+int main()
+{
+  bool is_open[100] = { false };
+ 
+  // do the 100 passes
+  for (int pass = 0; pass < 100; ++pass)
+    for (int door = pass; door < 100; door += pass+1)
+      is_open[door] = !is_open[door];
+ 
+  // output the result
+  for (int door = 0; door < 100; ++door)
+    std::cout << "door #" << door+1 << (is_open[door]? " is open." : " is closed.") << std::endl;
+  return 0;
+}
+

fixtures/bench_is_prime.cpp

@@ -0,0 +1,13 @@
+#include <cmath>
+ 
+bool is_prime(unsigned int n)
+{
+    if (n <= 1)
+        return false;
+    if (n == 2)
+        return true;
+    for (unsigned int i = 2; i <= sqrt(n); ++i)
+        if (n % i == 0)
+            return false;
+    return true;
+}

fixtures/bench_mutual_recursion.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <vector>
+#include <iterator>
+ 
+class Hofstadter
+{
+public:
+  static int F(int n) {
+    if ( n == 0 ) return 1;
+    return n - M(F(n-1));
+  }
+  static int M(int n) {
+    if ( n == 0 ) return 0;
+    return n - F(M(n-1));
+  }
+};
+ 
+using namespace std;
+ 
+int main()
+{
+  int i;
+  vector<int> ra, rb;
+ 
+  for(i=0; i < 20; i++) {
+    ra.push_back(Hofstadter::F(i));
+    rb.push_back(Hofstadter::M(i));
+  }
+  copy(ra.begin(), ra.end(),
+       ostream_iterator<int>(cout, " "));
+  cout << endl;
+  copy(rb.begin(), rb.end(),
+       ostream_iterator<int>(cout, " "));
+  cout << endl;
+  return 0;
+}