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/swift/chapter_greedy/coin_change_greedy.swift

@@ -0,0 +1,54 @@
+/**
+ * File: coin_change_greedy.swift
+ * Created Time: 2023-09-03
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+/* Coin change: Greedy algorithm */
+func coinChangeGreedy(coins: [Int], amt: Int) -> Int {
+    // Assume coins list is sorted
+    var i = coins.count - 1
+    var count = 0
+    var amt = amt
+    // 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 -= 1
+        }
+        // Choose coins[i]
+        amt -= coins[i]
+        count += 1
+    }
+    // If no feasible solution is found, return -1
+    return amt == 0 ? count : -1
+}
+
+@main
+enum CoinChangeGreedy {
+    /* Driver Code */
+    static func main() {
+        // Greedy algorithm: Can guarantee finding the global optimal solution
+        var coins = [1, 5, 10, 20, 50, 100]
+        var amt = 186
+        var res = coinChangeGreedy(coins: coins, amt: amt)
+        print("\ncoins = \(coins), amount = \(amt)")
+        print("Minimum coins needed to make \(amt) is \(res)")
+
+        // Greedy algorithm: Cannot guarantee finding the global optimal solution
+        coins = [1, 20, 50]
+        amt = 60
+        res = coinChangeGreedy(coins: coins, amt: amt)
+        print("\ncoins = \(coins), amount = \(amt)")
+        print("Minimum coins needed to make \(amt) is \(res)")
+        print("Actually the minimum number needed is 3, i.e., 20 + 20 + 20")
+
+        // Greedy algorithm: Cannot guarantee finding the global optimal solution
+        coins = [1, 49, 50]
+        amt = 98
+        res = coinChangeGreedy(coins: coins, amt: amt)
+        print("\ncoins = \(coins), amount = \(amt)")
+        print("Minimum coins needed to make \(amt) is \(res)")
+        print("Actually the minimum number needed is 2, i.e., 49 + 49")
+    }
+}

en/codes/swift/chapter_greedy/fractional_knapsack.swift

@@ -0,0 +1,57 @@
+/**
+ * File: fractional_knapsack.swift
+ * Created Time: 2023-09-03
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+/* Item */
+class Item {
+    var w: Int // Item weight
+    var v: Int // Item value
+
+    init(w: Int, v: Int) {
+        self.w = w
+        self.v = v
+    }
+}
+
+/* Fractional knapsack: Greedy algorithm */
+func fractionalKnapsack(wgt: [Int], val: [Int], cap: Int) -> Double {
+    // Create item list with two attributes: weight, value
+    var items = zip(wgt, val).map { Item(w: $0, v: $1) }
+    // Sort by unit value item.v / item.w from high to low
+    items.sort { -(Double($0.v) / Double($0.w)) < -(Double($1.v) / Double($1.w)) }
+    // Loop for greedy selection
+    var res = 0.0
+    var cap = cap
+    for item in items {
+        if item.w <= cap {
+            // If remaining capacity is sufficient, put the entire current item into the knapsack
+            res += Double(item.v)
+            cap -= item.w
+        } else {
+            // If remaining capacity is insufficient, put part of the current item into the knapsack
+            res += Double(item.v) / Double(item.w) * Double(cap)
+            // No remaining capacity, so break out of the loop
+            break
+        }
+    }
+    return res
+}
+
+@main
+enum FractionalKnapsack {
+    /* Driver Code */
+    static func main() {
+        // Item weight
+        let wgt = [10, 20, 30, 40, 50]
+        // Item value
+        let val = [50, 120, 150, 210, 240]
+        // Knapsack capacity
+        let cap = 50
+
+        // Greedy algorithm
+        let res = fractionalKnapsack(wgt: wgt, val: val, cap: cap)
+        print("Maximum item value not exceeding knapsack capacity is \(res)")
+    }
+}

en/codes/swift/chapter_greedy/max_capacity.swift

@@ -0,0 +1,38 @@
+/**
+ * File: max_capacity.swift
+ * Created Time: 2023-09-03
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+/* Max capacity: Greedy algorithm */
+func maxCapacity(ht: [Int]) -> Int {
+    // Initialize i, j to be at both ends of the array
+    var i = ht.startIndex, j = ht.endIndex - 1
+    // Initial max capacity is 0
+    var res = 0
+    // Loop for greedy selection until the two boards meet
+    while i < j {
+        // Update max capacity
+        let cap = min(ht[i], ht[j]) * (j - i)
+        res = max(res, cap)
+        // Move the shorter board inward
+        if ht[i] < ht[j] {
+            i += 1
+        } else {
+            j -= 1
+        }
+    }
+    return res
+}
+
+@main
+enum MaxCapacity {
+    /* Driver Code */
+    static func main() {
+        let ht = [3, 8, 5, 2, 7, 7, 3, 4]
+
+        // Greedy algorithm
+        let res = maxCapacity(ht: ht)
+        print("Maximum capacity is \(res)")
+    }
+}

en/codes/swift/chapter_greedy/max_product_cutting.swift

@@ -0,0 +1,43 @@
+/**
+ * File: max_product_cutting.swift
+ * Created Time: 2023-09-03
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+import Foundation
+
+func pow(_ x: Int, _ y: Int) -> Int {
+    Int(Double(truncating: pow(Decimal(x), y) as NSDecimalNumber))
+}
+
+/* Max product cutting: Greedy algorithm */
+func maxProductCutting(n: Int) -> Int {
+    // 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
+    let a = n / 3
+    let 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)
+}
+
+@main
+enum MaxProductCutting {
+    static func main() {
+        let n = 58
+
+        // Greedy algorithm
+        let res = maxProductCutting(n: n)
+        print("Maximum cutting product is \(res)")
+    }
+}