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-08-12 03:40:58 +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,106 @@
+// File: space_complexity.go
+// Created Time: 2022-12-15
+// Author: cathay (cathaycchen@gmail.com)
+
+package chapter_computational_complexity
+
+import (
+	"fmt"
+	"strconv"
+
+	. "github.com/krahets/hello-algo/pkg"
+)
+
+/* Struct */
+type node struct {
+	val  int
+	next *node
+}
+
+/* Create node struct */
+func newNode(val int) *node {
+	return &node{val: val}
+}
+
+/* Function */
+func function() int {
+	// Perform some operations...
+	return 0
+}
+
+/* Constant order */
+func spaceConstant(n int) {
+	// Constants, variables, objects occupy O(1) space
+	const a = 0
+	b := 0
+	nums := make([]int, 10000)
+	node := newNode(0)
+	// Variables in the loop occupy O(1) space
+	var c int
+	for i := 0; i < n; i++ {
+		c = 0
+	}
+	// Functions in the loop occupy O(1) space
+	for i := 0; i < n; i++ {
+		function()
+	}
+	b += 0
+	c += 0
+	nums[0] = 0
+	node.val = 0
+}
+
+/* Linear order */
+func spaceLinear(n int) {
+	// Array of length n uses O(n) space
+	_ = make([]int, n)
+	// A list of length n occupies O(n) space
+	var nodes []*node
+	for i := 0; i < n; i++ {
+		nodes = append(nodes, newNode(i))
+	}
+	// A hash table of length n occupies O(n) space
+	m := make(map[int]string, n)
+	for i := 0; i < n; i++ {
+		m[i] = strconv.Itoa(i)
+	}
+}
+
+/* Linear order (recursive implementation) */
+func spaceLinearRecur(n int) {
+	fmt.Println("Recursion n =", n)
+	if n == 1 {
+		return
+	}
+	spaceLinearRecur(n - 1)
+}
+
+/* Exponential order */
+func spaceQuadratic(n int) {
+	// Matrix uses O(n^2) space
+	numMatrix := make([][]int, n)
+	for i := 0; i < n; i++ {
+		numMatrix[i] = make([]int, n)
+	}
+}
+
+/* Quadratic order (recursive implementation) */
+func spaceQuadraticRecur(n int) int {
+	if n <= 0 {
+		return 0
+	}
+	nums := make([]int, n)
+	fmt.Printf("In recursion n = %d, nums length = %d \n", n, len(nums))
+	return spaceQuadraticRecur(n - 1)
+}
+
+/* Driver Code */
+func buildTree(n int) *TreeNode {
+	if n == 0 {
+		return nil
+	}
+	root := NewTreeNode(0)
+	root.Left = buildTree(n - 1)
+	root.Right = buildTree(n - 1)
+	return root
+}