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-26 04:56:06 +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,70 @@
+=begin
+File: recursion.rb
+Created Time: 2024-03-30
+Author: Xuan Khoa Tu Nguyen (ngxktuzkai2000@gmail.com)
+=end
+
+### Recursion ###
+def recur(n)
+  # Termination condition
+  return 1 if n == 1
+  # Recurse: recursive call
+  res = recur(n - 1)
+  # Return: return result
+  n + res
+end
+
+### Use iteration to simulate recursion ###
+def for_loop_recur(n)
+  # Use an explicit stack to simulate the system call stack
+  stack = []
+  res = 0
+
+  # Recurse: recursive call
+  for i in n.downto(0)
+    # Simulate "recurse" with "push"
+    stack << i
+  end
+  # Return: return result
+  while !stack.empty?
+    res += stack.pop
+  end
+
+  # res = 1+2+3+...+n
+  res
+end
+
+### Tail recursion ###
+def tail_recur(n, res)
+  # Termination condition
+  return res if n == 0
+  # Tail recursive call
+  tail_recur(n - 1, res + n)
+end
+
+### Fibonacci sequence: recursion ###
+def fib(n)
+  # Termination condition f(1) = 0, f(2) = 1
+  return n - 1 if n == 1 || n == 2
+  # Recursive call f(n) = f(n-1) + f(n-2)
+  res = fib(n - 1) + fib(n - 2)
+  # Return result f(n)
+  res
+end
+
+### Driver Code ###
+if __FILE__ == $0
+  n = 5
+
+  res = recur(n)
+  puts "\nRecursion sum result res = #{res}"
+
+  res = for_loop_recur(n)
+  puts "\nUsing iteration to simulate recursion sum result res = #{res}"
+
+  res = tail_recur(n, 0)
+  puts "\nTail recursion sum result res = #{res}"
+
+  res = fib(n)
+  puts "\nThe #{n}th Fibonacci number is #{res}"
+end