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,76 @@
+/*
+ * File: recursion.rs
+ * Created Time: 2023-09-02
+ * Author: night-cruise (2586447362@qq.com)
+ */
+
+/* Recursion */
+fn recur(n: i32) -> i32 {
+    // Termination condition
+    if n == 1 {
+        return 1;
+    }
+    // Recurse: recursive call
+    let res = recur(n - 1);
+    // Return: return result
+    n + res
+}
+
+/* Simulate recursion using iteration */
+fn for_loop_recur(n: i32) -> i32 {
+    // Use an explicit stack to simulate the system call stack
+    let mut stack = Vec::new();
+    let mut res = 0;
+    // Recurse: recursive call
+    for i in (1..=n).rev() {
+        // Simulate "recurse" with "push"
+        stack.push(i);
+    }
+    // Return: return result
+    while !stack.is_empty() {
+        // Simulate "return" with "pop"
+        res += stack.pop().unwrap();
+    }
+    // res = 1+2+3+...+n
+    res
+}
+
+/* Tail recursion */
+fn tail_recur(n: i32, res: i32) -> i32 {
+    // Termination condition
+    if n == 0 {
+        return res;
+    }
+    // Tail recursive call
+    tail_recur(n - 1, res + n)
+}
+
+/* Fibonacci sequence: recursion */
+fn fib(n: i32) -> i32 {
+    // 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)
+    let res = fib(n - 1) + fib(n - 2);
+    // Return result
+    res
+}
+
+/* Driver Code */
+fn main() {
+    let n = 5;
+    let mut res;
+
+    res = recur(n);
+    println!("\nRecursion sum result res = {res}");
+
+    res = for_loop_recur(n);
+    println!("\nUsing iteration to simulate recursion sum result res = {res}");
+
+    res = tail_recur(n, 0);
+    println!("\nTail recursion sum result res = {res}");
+
+    res = fib(n);
+    println!("\nThe {n}th Fibonacci number is {res}");
+}