CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-02-09 13:45:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Translate all code to English (#1836)

Browse Source 
* 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
This commit is contained in:
Yudong Jin
2025-12-31 07:44:52 +08:00
committed by GitHub
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
en/codes/java/chapter_computational_complexity/recursion.java
View File

@@ -14,25 +14,25 @@ public class recursion {
// Termination condition
if (n == 1)
return 1;
// Recursive: recursive call
// Recurse: recursive call
int res = recur(n - 1);
// Return: return result
return n + res;
}
/* Simulate recursion with iteration */
/* Simulate recursion using iteration */
static int forLoopRecur(int n) {
// Use an explicit stack to simulate the system call stack
Stack<Integer> stack = new Stack<>();
int res = 0;
// Recursive: recursive call
// Recurse: recursive call
for (int i = n; i > 0; i--) {
// Simulate "recursive" by "pushing onto the stack"
// Simulate "recurse" with "push"
stack.push(i);
}
// Return: return result
while (!stack.isEmpty()) {
// Simulate "return" by "popping from the stack"
// Simulate "return" with "pop"
res += stack.pop();
}
// res = 1+2+3+...+n
@@ -48,7 +48,7 @@ public class recursion {
return tailRecur(n - 1, res + n);
}
/* Fibonacci sequence: Recursion */
/* Fibonacci sequence: recursion */
static int fib(int n) {
// Termination condition f(1) = 0, f(2) = 1
if (n == 1 || n == 2)
@@ -65,15 +65,15 @@ public class recursion {
int res;
res = recur(n);
System.out.println("\nSum result of the recursive function res = " + res);
System.out.println("\nRecursive function sum result res = " + res);
res = forLoopRecur(n);
System.out.println("\nSum result using iteration to simulate recursion res = " + res);
System.out.println("\nUsing iteration to simulate recursive sum result res = " + res);
res = tailRecur(n, 0);
System.out.println("\nSum result of the tail-recursive function res = " + res);
System.out.println("\nTail recursive function sum result res = " + res);
res = fib(n);
System.out.println("\nThe " + n + "th number in the Fibonacci sequence is " + res);
System.out.println("\nThe " + n + "th term of the Fibonacci sequence is " + res);
}
}