CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-05 11:41:22 +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

30
en/codes/cpp/chapter_computational_complexity/space_complexity.cpp
View File

@@ -12,26 +12,26 @@ int func() {
return 0;
}
/* Constant complexity */
/* Constant order */
void constant(int n) {
// Constants, variables, objects occupy O(1) space
const int a = 0;
int b = 0;
vector<int> nums(10000);
ListNode node(0);
// Variables in a loop occupy O(1) space
// Variables in the loop occupy O(1) space
for (int i = 0; i < n; i++) {
int c = 0;
}
// Functions in a loop occupy O(1) space
// Functions in the loop occupy O(1) space
for (int i = 0; i < n; i++) {
func();
}
}
/* Linear complexity */
/* Linear order */
void linear(int n) {
// Array of length n occupies O(n) space
// Array of length n uses O(n) space
vector<int> nums(n);
// A list of length n occupies O(n) space
vector<ListNode> nodes;
@@ -45,7 +45,7 @@ void linear(int n) {
}
}
/* Linear complexity (recursive implementation) */
/* Linear order (recursive implementation) */
void linearRecur(int n) {
cout << "Recursion n = " << n << endl;
if (n == 1)
@@ -53,9 +53,9 @@ void linearRecur(int n) {
linearRecur(n - 1);
}
/* Quadratic complexity */
/* Exponential order */
void quadratic(int n) {
// A two-dimensional list occupies O(n^2) space
// 2D list uses O(n^2) space
vector<vector<int>> numMatrix;
for (int i = 0; i < n; i++) {
vector<int> tmp;
@@ -66,16 +66,16 @@ void quadratic(int n) {
}
}
/* Quadratic complexity (recursive implementation) */
/* Quadratic order (recursive implementation) */
int quadraticRecur(int n) {
if (n <= 0)
return 0;
vector<int> nums(n);
cout << "Recursive n = " << n << ", length of nums = " << nums.size() << endl;
cout << "In recursion n = " << n << ", nums length = " << nums.size() << endl;
return quadraticRecur(n - 1);
}
/* Exponential complexity (building a full binary tree) */
/* Driver Code */
TreeNode *buildTree(int n) {
if (n == 0)
return nullptr;
@@ -88,15 +88,15 @@ TreeNode *buildTree(int n) {
/* Driver Code */
int main() {
int n = 5;
// Constant complexity
// Constant order
constant(n);
// Linear complexity
// Linear order
linear(n);
linearRecur(n);
// Quadratic complexity
// Exponential order
quadratic(n);
quadraticRecur(n);
// Exponential complexity
// Exponential order
TreeNode *root = buildTree(n);
printTree(root);