Add the section of iteration and recursion. (#693)

codes/cpp/chapter_computational_complexity/CMakeLists.txt

@@ -1,3 +1,5 @@
+add_executable(iteration iteration.cpp)
+add_executable(recursion recursion.cpp)
 add_executable(space_complexity space_complexity.cpp)
 add_executable(time_complexity time_complexity.cpp)
 add_executable(worst_best_time_complexity worst_best_time_complexity.cpp)

codes/cpp/chapter_computational_complexity/iteration.cpp

@@ -0,0 +1,76 @@
+/**
+ * File: iteration.cpp
+ * Created Time: 2023-08-24
+ * Author: Krahets (krahets@163.com)
+ */
+
+#include "../utils/common.hpp"
+
+/* for 循环 */
+int forLoop(int n) {
+    int res = 0;
+    // 循环求和 1, 2, ..., n-1, n
+    for (int i = 1; i <= n; ++i) {
+        res += i;
+    }
+    return res;
+}
+
+/* while 循环 */
+int whileLoop(int n) {
+    int res = 0;
+    int i = 1; // 初始化条件变量
+    // 循环求和 1, 2, ..., n-1, n
+    while (i <= n) {
+        res += i;
+        i += 1; // 更新条件变量
+    }
+    return res;
+}
+
+/* while 循环（两次更新） */
+int whileLoopII(int n) {
+    int res = 0;
+    int i = 1; // 初始化条件变量
+    // 循环求和 1, 2, 4, 5...
+    while (i <= n) {
+        res += i;
+        i += 1; // 更新条件变量
+        res += i;
+        i *= 2; // 更新条件变量
+    }
+    return res;
+}
+
+/* 双层 for 循环 */
+string nestedForLoop(int n) {
+    ostringstream res;
+    // 循环 i = 1, 2, ..., n-1, n
+    for (int i = 1; i <= n; ++i) {
+        // 循环 j = 1, 2, ..., n-1, n
+        for (int j = 1; j <= n; ++j) {
+            res << "(" << i << ", " << j << "), ";
+        }
+    }
+    return res.str();
+}
+
+/* Driver Code */
+int main() {
+    int n = 5;
+    int res;
+
+    res = forLoop(n);
+    cout << "\nfor 循环的求和结果 res = " << res << endl;
+
+    res = whileLoop(n);
+    cout << "\nwhile 循环的求和结果 res = " << res << endl;
+
+    res = whileLoopII(n);
+    cout << "\nwhile 循环（两次更新）求和结果 res = " << res << endl;
+
+    string resStr = nestedForLoop(n);
+    cout << "\n双层 for 循环的遍历结果 " << resStr << endl;
+
+    return 0;
+}

codes/cpp/chapter_computational_complexity/recursion.cpp

@@ -0,0 +1,55 @@
+/**
+ * File: recursion.cpp
+ * Created Time: 2023-08-24
+ * Author: Krahets (krahets@163.com)
+ */
+
+#include "../utils/common.hpp"
+
+/* 递归 */
+int recur(int n) {
+    // 终止条件
+    if (n == 1)
+        return 1;
+    // 递：递归调用
+    int res = recur(n - 1);
+    // 归：返回结果
+    return n + res;
+}
+
+/* 尾递归 */
+int tailRecur(int n, int res) {
+    // 终止条件
+    if (n == 0)
+        return res;
+    // 尾递归调用
+    return tailRecur(n - 1, res + n);
+}
+
+/* 斐波那契数列：递归 */
+int fib(int n) {
+    // 终止条件 f(1) = 0, f(2) = 1
+    if (n == 1 || n == 2)
+        return n - 1;
+    // 递归调用 f(n) = f(n-1) + f(n-2)
+    int res = fib(n - 1) + fib(n - 2);
+    // 返回结果 f(n)
+    return res;
+}
+
+/* Driver Code */
+int main() {
+    int n = 5;
+    int res;
+
+    res = recur(n);
+    cout << "\n递归函数的求和结果 res = " << res << endl;
+
+    res = tailRecur(n, 0);
+    cout << "\n尾递归函数的求和结果 res = " << res << endl;
+
+    res = fib(n);
+    cout << "\n斐波那契数列的第 " << n << " 项为 " << res << endl;
+
+    return 0;
+}