CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-08 13:21:19 +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/python/chapter_computational_complexity/recursion.py
View File

@@ -10,24 +10,24 @@ def recur(n: int) -> int:
# Termination condition
if n == 1:
return 1
# Recursive: recursive call
# Recurse: recursive call
res = recur(n - 1)
# Return: return result
return n + res
def for_loop_recur(n: int) -> int:
"""Simulate recursion with iteration"""
"""Simulate recursion using iteration"""
# Use an explicit stack to simulate the system call stack
stack = []
res = 0
# Recursive: recursive call
# Recurse: recursive call
for i in range(n, 0, -1):
# Simulate "recursive" by "pushing onto the stack"
# Simulate "recurse" with "push"
stack.append(i)
# Return: return result
while stack:
# Simulate "return" by "popping from the stack"
# Simulate "return" with "pop"
res += stack.pop()
# res = 1+2+3+...+n
return res
@@ -43,7 +43,7 @@ def tail_recur(n, res):
def fib(n: int) -> int:
"""Fibonacci sequence: Recursion"""
"""Fibonacci sequence: recursion"""
# Termination condition f(1) = 0, f(2) = 1
if n == 1 or n == 2:
return n - 1
@@ -57,13 +57,13 @@ def fib(n: int) -> int:
if __name__ == "__main__":
n = 5
res = recur(n)
print(f"\nRecursive function sum result res = {res}")
print(f"\nSum result of recursive function res = {res}")
res = for_loop_recur(n)
print(f"\nSimulate recursion with iteration sum result res = {res}")
print(f"\nSum result of simulating recursion using iteration res = {res}")
res = tail_recur(n, 0)
print(f"\nTail recursive function sum result res = {res}")
print(f"\nSum result of tail recursive function res = {res}")
res = fib(n)
print(f"\nThe n th term of the Fibonacci sequence is {res}")
print(f"\nThe {n}th term of the Fibonacci sequence is {res}")