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

en/codes/c/chapter_divide_and_conquer/CMakeLists.txt

@@ -0,0 +1,3 @@
+add_executable(binary_search_recur binary_search_recur.c)
+add_executable(build_tree build_tree.c)
+add_executable(hanota hanota.c)

en/codes/c/chapter_divide_and_conquer/binary_search_recur.c

@@ -0,0 +1,47 @@
+/**
+ * File: binary_search_recur.c
+ * Created Time: 2023-10-01
+ * Author: Zuoxun (845242523@qq.com)
+ */
+
+#include "../utils/common.h"
+
+/* Binary search: problem f(i, j) */
+int dfs(int nums[], int target, int i, int j) {
+    // If the interval is empty, it means there is no target element, return -1
+    if (i > j) {
+        return -1;
+    }
+    // Calculate the midpoint index m
+    int m = (i + j) / 2;
+    if (nums[m] < target) {
+        // Recursion subproblem f(m+1, j)
+        return dfs(nums, target, m + 1, j);
+    } else if (nums[m] > target) {
+        // Recursion subproblem f(i, m-1)
+        return dfs(nums, target, i, m - 1);
+    } else {
+        // Found the target element, return its index
+        return m;
+    }
+}
+
+/* Binary search */
+int binarySearch(int nums[], int target, int numsSize) {
+    int n = numsSize;
+    // Solve the problem f(0, n-1)
+    return dfs(nums, target, 0, n - 1);
+}
+
+/* Driver Code */
+int main() {
+    int target = 6;
+    int nums[] = {1, 3, 6, 8, 12, 15, 23, 26, 31, 35};
+    int numsSize = sizeof(nums) / sizeof(nums[0]);
+
+    // Binary search (closed interval on both sides)
+    int index = binarySearch(nums, target, numsSize);
+    printf("Index of target element 6 = %d\n", index);
+
+    return 0;
+}

en/codes/c/chapter_divide_and_conquer/build_tree.c

@@ -0,0 +1,61 @@
+/**
+ * File : build_tree.c
+ * Created Time: 2023-10-16
+ * Author : lucas (superrat6@gmail.com)
+ */
+
+#include "../utils/common.h"
+
+// Assume all elements less than 1000
+#define MAX_SIZE 1000
+
+/* Build binary tree: divide and conquer */
+TreeNode *dfs(int *preorder, int *inorderMap, int i, int l, int r, int size) {
+    // Terminate when the subtree interval is empty
+    if (r - l < 0)
+        return NULL;
+    // Initialize the root node
+    TreeNode *root = (TreeNode *)malloc(sizeof(TreeNode));
+    root->val = preorder[i];
+    root->left = NULL;
+    root->right = NULL;
+    // Query m to divide the left and right subtrees
+    int m = inorderMap[preorder[i]];
+    // Subproblem: build the left subtree
+    root->left = dfs(preorder, inorderMap, i + 1, l, m - 1, size);
+    // Subproblem: build the right subtree
+    root->right = dfs(preorder, inorderMap, i + 1 + m - l, m + 1, r, size);
+    // Return the root node
+    return root;
+}
+
+/* Build binary tree */
+TreeNode *buildTree(int *preorder, int preorderSize, int *inorder, int inorderSize) {
+    // Initialize hash map, storing the mapping from inorder elements to indices
+    int *inorderMap = (int *)malloc(sizeof(int) * MAX_SIZE);
+    for (int i = 0; i < inorderSize; i++) {
+        inorderMap[inorder[i]] = i;
+    }
+    TreeNode *root = dfs(preorder, inorderMap, 0, 0, inorderSize - 1, inorderSize);
+    free(inorderMap);
+    return root;
+}
+
+/* Driver Code */
+int main() {
+    int preorder[] = {3, 9, 2, 1, 7};
+    int inorder[] = {9, 3, 1, 2, 7};
+    int preorderSize = sizeof(preorder) / sizeof(preorder[0]);
+    int inorderSize = sizeof(inorder) / sizeof(inorder[0]);
+    printf("Preorder traversal = ");
+    printArray(preorder, preorderSize);
+    printf("Inorder traversal = ");
+    printArray(inorder, inorderSize);
+
+    TreeNode *root = buildTree(preorder, preorderSize, inorder, inorderSize);
+    printf("The constructed binary tree is:\n");
+    printTree(root);
+
+    freeMemoryTree(root);
+    return 0;
+}

en/codes/c/chapter_divide_and_conquer/hanota.c

@@ -0,0 +1,74 @@
+/**
+ * File: hanota.c
+ * Created Time: 2023-10-01
+ * Author: Zuoxun (845242523@qq.com), lucas(superrat6@gmail.com)
+ */
+
+#include "../utils/common.h"
+
+// Assume at most 1000 permutations
+#define MAX_SIZE 1000
+
+/* Move a disk */
+void move(int *src, int *srcSize, int *tar, int *tarSize) {
+    // Take out a disk from the top of src
+    int pan = src[*srcSize - 1];
+    src[*srcSize - 1] = 0;
+    (*srcSize)--;
+    // Place the disk on top of tar
+    tar[*tarSize] = pan;
+    (*tarSize)++;
+}
+
+/* Solve the Tower of Hanoi problem f(i) */
+void dfs(int i, int *src, int *srcSize, int *buf, int *bufSize, int *tar, int *tarSize) {
+    // If there is only one disk left in src, move it directly to tar
+    if (i == 1) {
+        move(src, srcSize, tar, tarSize);
+        return;
+    }
+    // Subproblem f(i-1): move the top i-1 disks from src to buf using tar
+    dfs(i - 1, src, srcSize, tar, tarSize, buf, bufSize);
+    // Subproblem f(1): move the remaining disk from src to tar
+    move(src, srcSize, tar, tarSize);
+    // Subproblem f(i-1): move the top i-1 disks from buf to tar using src
+    dfs(i - 1, buf, bufSize, src, srcSize, tar, tarSize);
+}
+
+/* Solve the Tower of Hanoi problem */
+void solveHanota(int *A, int *ASize, int *B, int *BSize, int *C, int *CSize) {
+    // Move the top n disks from A to C using B
+    dfs(*ASize, A, ASize, B, BSize, C, CSize);
+}
+
+/* Driver Code */
+int main() {
+    // The tail of the list is the top of the rod
+    int a[] = {5, 4, 3, 2, 1};
+    int b[MAX_SIZE] = {0};
+    int c[MAX_SIZE] = {0};
+
+    int ASize = sizeof(a) / sizeof(a[0]);
+    int BSize = 0;
+    int CSize = 0;
+
+    printf("\nInitial state:");
+    printf("\nA = ");
+    printArray(a, ASize);
+    printf("B = ");
+    printArray(b, BSize);
+    printf("C = ");
+    printArray(c, CSize);
+
+    solveHanota(a, &ASize, b, &BSize, c, &CSize);
+
+    printf("\nAfter disk movement:");
+    printf("A = ");
+    printArray(a, ASize);
+    printf("B = ");
+    printArray(b, BSize);
+    printf("C = ");
+    printArray(c, CSize);
+
+    return 0;
+}