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_greedy/CMakeLists.txt

@@ -0,0 +1,8 @@
+add_executable(coin_change_greedy coin_change_greedy.c)
+add_executable(fractional_knapsack fractional_knapsack.c)
+add_executable(max_capacity max_capacity.c)
+add_executable(max_product_cutting max_product_cutting.c)
+
+if (NOT CMAKE_C_COMPILER_ID STREQUAL "MSVC")
+    target_link_libraries(max_product_cutting m)
+endif()

en/codes/c/chapter_greedy/coin_change_greedy.c

@@ -0,0 +1,60 @@
+/**
+ * File: coin_change_greedy.c
+ * Created Time: 2023-09-07
+ * Author: lwbaptx (lwbaptx@gmail.com)
+ */
+
+#include "../utils/common.h"
+
+/* Coin change: Greedy algorithm */
+int coinChangeGreedy(int *coins, int size, int amt) {
+    // Assume coins list is sorted
+    int i = size - 1;
+    int count = 0;
+    // Loop to make greedy choices until no remaining amount
+    while (amt > 0) {
+        // Find the coin that is less than and closest to the remaining amount
+        while (i > 0 && coins[i] > amt) {
+            i--;
+        }
+        // Choose coins[i]
+        amt -= coins[i];
+        count++;
+    }
+    // If no feasible solution is found, return -1
+    return amt == 0 ? count : -1;
+}
+
+/* Driver Code */
+int main() {
+    // Greedy algorithm: Can guarantee finding the global optimal solution
+    int coins1[6] = {1, 5, 10, 20, 50, 100};
+    int amt = 186;
+    int res = coinChangeGreedy(coins1, 6, amt);
+    printf("\ncoins = ");
+    printArray(coins1, 6);
+    printf("amt = %d\n", amt);
+    printf("Minimum number of coins needed to make %d is %d\n", amt, res);
+
+    // Greedy algorithm: Cannot guarantee finding the global optimal solution
+    int coins2[3] = {1, 20, 50};
+    amt = 60;
+    res = coinChangeGreedy(coins2, 3, amt);
+    printf("\ncoins = ");
+    printArray(coins2, 3);
+    printf("amt = %d\n", amt);
+    printf("Minimum number of coins needed to make %d is %d\n", amt, res);
+    printf("Actually minimum needed is 3, i.e., 20 + 20 + 20\n");
+
+    // Greedy algorithm: Cannot guarantee finding the global optimal solution
+    int coins3[3] = {1, 49, 50};
+    amt = 98;
+    res = coinChangeGreedy(coins3, 3, amt);
+    printf("\ncoins = ");
+    printArray(coins3, 3);
+    printf("amt = %d\n", amt);
+    printf("Minimum number of coins needed to make %d is %d\n", amt, res);
+    printf("Actually minimum needed is 2, i.e., 49 + 49\n");
+
+    return 0;
+}

en/codes/c/chapter_greedy/fractional_knapsack.c

@@ -0,0 +1,60 @@
+/**
+ * File: fractional_knapsack.c
+ * Created Time: 2023-09-14
+ * Author: xianii (xianyi.xia@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+/* Item */
+typedef struct {
+    int w; // Item weight
+    int v; // Item value
+} Item;
+
+/* Sort by value density */
+int sortByValueDensity(const void *a, const void *b) {
+    Item *t1 = (Item *)a;
+    Item *t2 = (Item *)b;
+    return (float)(t1->v) / t1->w < (float)(t2->v) / t2->w;
+}
+
+/* Fractional knapsack: Greedy algorithm */
+float fractionalKnapsack(int wgt[], int val[], int itemCount, int cap) {
+    // Create item list with two attributes: weight, value
+    Item *items = malloc(sizeof(Item) * itemCount);
+    for (int i = 0; i < itemCount; i++) {
+        items[i] = (Item){.w = wgt[i], .v = val[i]};
+    }
+    // Sort by unit value item.v / item.w from high to low
+    qsort(items, (size_t)itemCount, sizeof(Item), sortByValueDensity);
+    // Loop for greedy selection
+    float res = 0.0;
+    for (int i = 0; i < itemCount; i++) {
+        if (items[i].w <= cap) {
+            // If remaining capacity is sufficient, put the entire current item into the knapsack
+            res += items[i].v;
+            cap -= items[i].w;
+        } else {
+            // If remaining capacity is insufficient, put part of the current item into the knapsack
+            res += (float)cap / items[i].w * items[i].v;
+            cap = 0;
+            break;
+        }
+    }
+    free(items);
+    return res;
+}
+
+/* Driver Code */
+int main(void) {
+    int wgt[] = {10, 20, 30, 40, 50};
+    int val[] = {50, 120, 150, 210, 240};
+    int capacity = 50;
+
+    // Greedy algorithm
+    float res = fractionalKnapsack(wgt, val, sizeof(wgt) / sizeof(int), capacity);
+    printf("Maximum item value not exceeding knapsack capacity is %0.2f\n", res);
+
+    return 0;
+}

en/codes/c/chapter_greedy/max_capacity.c

@@ -0,0 +1,49 @@
+/**
+ * File: max_capacity.c
+ * Created Time: 2023-09-15
+ * Author: xianii (xianyi.xia@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+/* Find minimum value */
+int myMin(int a, int b) {
+    return a < b ? a : b;
+}
+/* Find maximum value */
+int myMax(int a, int b) {
+    return a > b ? a : b;
+}
+
+/* Max capacity: Greedy algorithm */
+int maxCapacity(int ht[], int htLength) {
+    // Initialize i, j to be at both ends of the array
+    int i = 0;
+    int j = htLength - 1;
+    // Initial max capacity is 0
+    int res = 0;
+    // Loop for greedy selection until the two boards meet
+    while (i < j) {
+        // Update max capacity
+        int capacity = myMin(ht[i], ht[j]) * (j - i);
+        res = myMax(res, capacity);
+        // Move the shorter board inward
+        if (ht[i] < ht[j]) {
+            i++;
+        } else {
+            j--;
+        }
+    }
+    return res;
+}
+
+/* Driver Code */
+int main(void) {
+    int ht[] = {3, 8, 5, 2, 7, 7, 3, 4};
+
+    // Greedy algorithm
+    int res = maxCapacity(ht, sizeof(ht) / sizeof(int));
+    printf("Maximum capacity is %d\n", res);
+
+    return 0;
+}

en/codes/c/chapter_greedy/max_product_cutting.c

@@ -0,0 +1,38 @@
+/**
+ * File: max_product_cutting.c
+ * Created Time: 2023-09-15
+ * Author: xianii (xianyi.xia@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+/* Max product cutting: Greedy algorithm */
+int maxProductCutting(int n) {
+    // When n <= 3, must cut out a 1
+    if (n <= 3) {
+        return 1 * (n - 1);
+    }
+    // Greedily cut out 3, a is the number of 3s, b is the remainder
+    int a = n / 3;
+    int b = n % 3;
+    if (b == 1) {
+        // When the remainder is 1, convert a pair of 1 * 3 to 2 * 2
+        return pow(3, a - 1) * 2 * 2;
+    }
+    if (b == 2) {
+        // When the remainder is 2, do nothing
+        return pow(3, a) * 2;
+    }
+    // When the remainder is 0, do nothing
+    return pow(3, a);
+}
+
+/* Driver Code */
+int main(void) {
+    int n = 58;
+    // Greedy algorithm
+    int res = maxProductCutting(n);
+    printf("Maximum cutting product is %d\n", res);
+
+    return 0;
+}