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-30 11:57:13 +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,65 @@
+/*
+ * File: binary_search.rs
+ * Created Time: 2023-02-05
+ * Author: codingonion (coderonion@gmail.com)
+ */
+
+/* Binary search (closed interval on both sides) */
+fn binary_search(nums: &[i32], target: i32) -> i32 {
+    // Initialize closed interval [0, n-1], i.e., i, j point to the first and last elements of the array
+    let mut i = 0;
+    let mut j = nums.len() as i32 - 1;
+    // Loop, exit when the search interval is empty (empty when i > j)
+    while i <= j {
+        let m = i + (j - i) / 2; // Calculate the midpoint index m
+        if nums[m as usize] < target {
+            // This means target is in the interval [m+1, j]
+            i = m + 1;
+        } else if nums[m as usize] > 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) */
+fn binary_search_lcro(nums: &[i32], target: i32) -> i32 {
+    // Initialize left-closed right-open interval [0, n), i.e., i, j point to the first element and last element+1
+    let mut i = 0;
+    let mut j = nums.len() as i32;
+    // Loop, exit when the search interval is empty (empty when i = j)
+    while i < j {
+        let m = i + (j - i) / 2; // Calculate the midpoint index m
+        if nums[m as usize] < target {
+            // This means target is in the interval [m+1, j)
+            i = m + 1;
+        } else if nums[m as usize] > 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;
+}
+
+/* Driver Code */
+pub fn main() {
+    let target = 6;
+    let nums = [1, 3, 6, 8, 12, 15, 23, 26, 31, 35];
+
+    // Binary search (closed interval on both sides)
+    let mut index = binary_search(&nums, target);
+    println!("Index of target element 6 is {index}");
+
+    // Binary search (left-closed right-open interval)
+    index = binary_search_lcro(&nums, target);
+    println!("Index of target element 6 is {index}");
+}