Translate all code to English (#1836)

* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
2026-07-16 08:56:05 +00:00 · 2025-12-31 07:44:52 +08:00
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
@@ -0,0 +1,77 @@
+/**
+ * File: recursion.c
+ * Created Time: 2023-09-09
+ * Author: Gonglja (glj0@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+/* Recursion */
+int recur(int n) {
+    // Termination condition
+    if (n == 1)
+        return 1;
+    // Recurse: recursive call
+    int res = recur(n - 1);
+    // Return: return result
+    return n + res;
+}
+
+/* Simulate recursion using iteration */
+int forLoopRecur(int n) {
+    int stack[1000]; // Use a large array to simulate stack
+    int top = -1;    // Stack top index
+    int res = 0;
+    // Recurse: recursive call
+    for (int i = n; i > 0; i--) {
+        // Simulate "recurse" with "push"
+        stack[1 + top++] = i;
+    }
+    // Return: return result
+    while (top >= 0) {
+        // Simulate "return" with "pop"
+        res += stack[top--];
+    }
+    // res = 1+2+3+...+n
+    return res;
+}
+
+/* Tail recursion */
+int tailRecur(int n, int res) {
+    // Termination condition
+    if (n == 0)
+        return res;
+    // Tail recursive call
+    return tailRecur(n - 1, res + n);
+}
+
+/* Fibonacci sequence: recursion */
+int fib(int n) {
+    // Termination condition f(1) = 0, f(2) = 1
+    if (n == 1 || n == 2)
+        return n - 1;
+    // Recursive call f(n) = f(n-1) + f(n-2)
+    int res = fib(n - 1) + fib(n - 2);
+    // Return result f(n)
+    return res;
+}
+
+/* Driver Code */
+int main() {
+    int n = 5;
+    int res;
+
+    res = recur(n);
+    printf("\nRecursion sum result res = %d\n", res);
+
+    res = forLoopRecur(n);
+    printf("\nUsing iteration to simulate recursion sum result res = %d\n", res);
+
+    res = tailRecur(n, 0);
+    printf("\nTail recursion sum result res = %d\n", res);
+
+    res = fib(n);
+    printf("\nThe %dth Fibonacci number is %d\n", n, res);
+
+    return 0;
+}