first commit

Author: AceCoooool

README.md

@@ -1,2 +1,3 @@
 # algs4cplusplus
 Algorithms, 4th edition textbook code (using c++)
+

ch1/1_BinarySearch/CMakeLists.txt

@@ -0,0 +1,7 @@
+cmake_minimum_required(VERSION 3.8)
+project(1_BinarySearch)
+
+set(CMAKE_CXX_STANDARD 14)
+
+set(SOURCE_FILES main.cpp)
+add_executable(1_BinarySearch ${SOURCE_FILES})

ch1/1_BinarySearch/main.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+#include <vector>
+#include <fstream>
+#include <algorithm>
+
+using namespace std;
+
+/**
+* Returns the index of the specified key in the specified array.
+*
+* @param  a the array of integers, must be sorted in ascending order
+* @param  key the search key
+* @return index of key in array {@code a} if present; {@code -1} otherwise
+*/
+int indexOf(vector<int> &a, int key) {
+    int lo = 0, hi = a.size() - 1;
+    while (lo <= hi) {
+        // Key is in a[lo..hi] or not present.
+        int mid = lo + (hi - lo) / 2;
+        if (key < a[mid]) hi = mid - 1;
+        else if (key > a[mid]) lo = mid + 1;
+        else return mid;
+    }
+    return -1;
+}
+
+int main() {
+    // TODO: change to relative path
+    ifstream input("/home/ace/AceDev/C++/algorithm/ch1/1_BinarySearch/tinyW.txt");
+    vector<int> whitelist;
+    int t;
+    while (input >> t) {
+        whitelist.push_back(t);
+    }
+    sort(whitelist.begin(), whitelist.end());
+    ifstream check("/home/ace/AceDev/C++/algorithm/ch1/1_BinarySearch/tinyT.txt");
+    while (check >> t) {
+        int idx = indexOf(whitelist, t);
+        if (idx == -1)
+            cout << t << endl;
+    }
+}

ch1/1_BinarySearch/tinyT.txt

@@ -0,0 +1,18 @@
+23
+50
+10
+99
+18
+23
+98
+84
+11
+10
+48
+77
+13
+54
+98
+77
+77
+68

ch1/1_BinarySearch/tinyW.txt

@@ -0,0 +1,15 @@
+84
+48
+68
+10
+18
+98
+12
+23
+54
+57
+33
+16
+77
+11
+29

ch1/2_RandomSeq/CMakeLists.txt

@@ -0,0 +1,7 @@
+cmake_minimum_required(VERSION 3.8)
+project(2_RandomSeq)
+
+set(CMAKE_CXX_STANDARD 14)
+
+set(SOURCE_FILES main.cpp)
+add_executable(2_RandomSeq ${SOURCE_FILES})

ch1/2_RandomSeq/main.cpp

@@ -0,0 +1,32 @@
+#include <iostream>
+#include <vector>
+#include <iomanip>
+#include <algorithm>
+
+using namespace std;
+
+const int seed = 100;
+
+/**
+ * Reads in two command-line arguments lo and hi and prints n uniformly
+ * random real numbers in [lo, hi) to standard output.
+ *
+ * @param args the command-line arguments
+ */
+int main() {
+    int n = 10;
+    double lo = 0.0, hi = 1.0;
+    // uniform[0.0, 1.0)
+    default_random_engine e(seed);
+    uniform_real_distribution<double> dis(0.0, 1.0);
+    cout << fixed;
+    for (int i = 0; i < n; ++i)
+        cout << setprecision(4) << dis(e) << "  ";
+    cout << endl;
+    // uniform[lo, high)
+    lo = 2.5, hi = 3.0;
+    uniform_real_distribution<double> dis2(lo, hi);
+    for (int i = 0; i < n; ++i)
+        cout << setprecision(4) << dis2(e) << "  ";
+    cout << endl;
+}

ch1/3_Average/CMakeLists.txt

@@ -0,0 +1,7 @@
+cmake_minimum_required(VERSION 3.8)
+project(3_Average)
+
+set(CMAKE_CXX_STANDARD 14)
+
+set(SOURCE_FILES main.cpp)
+add_executable(3_Average ${SOURCE_FILES})

ch1/3_Average/main.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <vector>
+#include <iomanip>
+#include <algorithm>
+
+using namespace std;
+
+const int seed = 100;
+
+/**
+* Reads in a sequence of real numbers from standard input and prints
+* out their average to standard output.
+*
+* @param args the command-line arguments
+*/
+int main() {
+    int count = 0;
+    double sum = 0.0;
+    vector<double> arr{10.0, 5.0, 6.0, 3.0, 7.0, 32.0};
+    for (auto a: arr) {
+        sum += a;
+        count++;
+    }
+    double avg = sum / count;
+    cout << "Average is " << avg << endl;
+}

ch1/4_Cat/CMakeLists.txt

@@ -0,0 +1,7 @@
+cmake_minimum_required(VERSION 3.8)
+project(4_Cat)
+
+set(CMAKE_CXX_STANDARD 14)
+
+set(SOURCE_FILES main.cpp)
+add_executable(4_Cat ${SOURCE_FILES})