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/go/chapter_searching/binary_search.go

@@ -0,0 +1,43 @@
+// File: binary_search.go
+// Created Time: 2022-12-05
+// Author: Slone123c (274325721@qq.com)
+
+package chapter_searching
+
+/* Binary search (closed interval on both sides) */
+func binarySearch(nums []int, target int) int {
+	// Initialize closed interval [0, n-1], i.e., i, j point to the first and last elements of the array
+	i, j := 0, len(nums)-1
+	// Loop, exit when the search interval is empty (empty when i > j)
+	for i <= j {
+		m := i + (j-i)/2      // Calculate the midpoint index m
+		if nums[m] < target { // This means target is in the interval [m+1, j]
+			i = m + 1
+		} else if nums[m] > target { // This means target is in the interval [i, m-1]
+			j = m - 1
+		} else { // Found the target element, return its index
+			return m
+		}
+	}
+	// Target element not found, return -1
+	return -1
+}
+
+/* Binary search (left-closed right-open interval) */
+func binarySearchLCRO(nums []int, target int) int {
+	// Initialize left-closed right-open interval [0, n), i.e., i, j point to the first element and last element+1
+	i, j := 0, len(nums)
+	// Loop, exit when the search interval is empty (empty when i = j)
+	for i < j {
+		m := i + (j-i)/2      // Calculate the midpoint index m
+		if nums[m] < target { // This means target is in the interval [m+1, j)
+			i = m + 1
+		} else if nums[m] > target { // This means target is in the interval [i, m)
+			j = m
+		} else { // Found the target element, return its index
+			return m
+		}
+	}
+	// Target element not found, return -1
+	return -1
+}