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

en/codes/javascript/chapter_computational_complexity/recursion.js

@@ -0,0 +1,69 @@
+/**
+ * File: recursion.js
+ * Created Time: 2023-08-28
+ * Author: Gaofer Chou (gaofer-chou@qq.com)
+ */
+
+/* Recursion */
+function recur(n) {
+    // Termination condition
+    if (n === 1) return 1;
+    // Recurse: recursive call
+    const res = recur(n - 1);
+    // Return: return result
+    return n + res;
+}
+
+/* Simulate recursion using iteration */
+function forLoopRecur(n) {
+    // Use an explicit stack to simulate the system call stack
+    const stack = [];
+    let res = 0;
+    // Recurse: recursive call
+    for (let i = n; i > 0; i--) {
+        // Simulate "recurse" with "push"
+        stack.push(i);
+    }
+    // Return: return result
+    while (stack.length) {
+        // Simulate "return" with "pop"
+        res += stack.pop();
+    }
+    // res = 1+2+3+...+n
+    return res;
+}
+
+/* Tail recursion */
+function tailRecur(n, res) {
+    // Termination condition
+    if (n === 0) return res;
+    // Tail recursive call
+    return tailRecur(n - 1, res + n);
+}
+
+/* Fibonacci sequence: recursion */
+function fib(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)
+    const res = fib(n - 1) + fib(n - 2);
+    // Return result f(n)
+    return res;
+}
+
+/* Driver Code */
+const n = 5;
+let res;
+
+res = recur(n);
+console.log(`Recursion sum result res = ${res}`);
+
+res = forLoopRecur(n);
+console.log(`Using iteration to simulate recursion sum result res = ${res}`);
+
+res = tailRecur(n, 0);
+console.log(`Tail recursion sum result res = ${res}`);
+
+res = fib(n);
+console.log(`The ${n}th Fibonacci number is ${res}`);
+