ahh

Author: elstr-512

source/chpt_12_DynamicProgramming/main.cpp

@@ -0,0 +1,11 @@
+#include <iostream>
+#include <string>
+
+int main(int argc, char const *argv[]) {
+
+    std::string string = "hello";
+
+    std::cout << string.c_str() << std::endl;
+
+    return 0;
+}

source/chpt_7_Trees/TreeTraversal/Position.h

@@ -0,0 +1,25 @@
+#pragma once
+#include <list>
+
+class Position;
+class Tree;
+
+class Position {
+public:
+    int& operator*();
+    Position parent() const;
+    std::list<Position> children() const;
+    bool isRoot() const;
+    bool isExternal() const;
+};
+
+class Tree {
+public:
+    class Position;
+
+public:
+    int size() const;
+    bool empty() const;
+    Position root() const;
+    std::list<Position> positions() const;
+};

source/chpt_7_Trees/TreeTraversal/main.cpp

@@ -0,0 +1,10 @@
+#include "Position.h"
+#include <iostream>
+
+int main(int argc, char const *argv[]) {
+    std::cout << "Hello World" << std::endl;
+    
+    Tree tree;
+
+    return 0;
+}

source/chpt_9_misc/main.cpp

@@ -0,0 +1,42 @@
+#include <cstdlib>
+#include <ctime>
+#include <iostream>
+#include <vector>
+#include "merge.hpp"
+
+void printVector(std::vector<int> const &vector) {
+    for (int number : vector) {
+        std::cout << number << " ";
+    }   std::cout << "\n";
+}
+
+int main(int argc, char const *argv[]) {
+    std::vector<int> vector_even({ 
+    83, 13, 29, 57, 63, 35, 
+    92, 30, 57, 57, 43, 57, 
+    26, 36, 46, 12, 29, 78, 
+    39, 28, 75, 77, 52, 91, 
+    88, 13, 23, 12, 99, 93, 
+    14, 82, 96, 85, 92, 59, 
+    });
+
+    std::vector<int> vector_odd({ 
+    83, 13, 29, 57, 63, 35, 
+    92, 30, 57, 57, 43, 57, 
+    26, 36, 46, 12, 29, 78, 
+    39, 28, 75, 77, 52, 91, 
+    88, 13, 23, 12, 99, 93, 
+    14, 82, 96, 85, 92, 59, 
+    });
+
+
+
+    std::vector<int> s1({2, 5, 8, 11, 12, 14, 15});
+    std::vector<int> s2({3, 9, 10, 18, 19, 22, 25});
+
+    std::vector<int> merged = merge(s1, s2);
+
+    printVector(merged);
+
+    return 0; 
+}

source/chpt_9_misc/merge.hpp

@@ -0,0 +1,30 @@
+#pragma once
+#include <vector>
+
+std::vector<int> merge(std::vector<int> s_1, std::vector<int> s_2) {
+
+    int i = 0;
+    int j = 0;
+    std::vector<int> S;
+
+    while (i < s_1.size() && j < s_2.size()) {
+        if (s_1[i] <= s_2[j]) {
+            S.push_back(s_1[i]);
+            i++;
+        } else {
+            S.push_back(s_2[j]);
+            j++;
+        }
+    }
+
+    while (i < s_1.size()) {
+        S.push_back(s_1[i]);
+        i++;
+    }
+    while (j < s_2.size()) {
+        S.push_back(s_2[j]);
+        j++;
+    }
+
+    return S;
+}