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-09-03 05:37: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,67 @@
+/**
+ * File: binary_search_edge.c
+ * Created Time: 2023-09-09
+ * Author: Gonglja (glj0@outlook.com)
+ */
+
+#include "../utils/common.h"
+
+/* Binary search for insertion point (with duplicate elements) */
+int binarySearchInsertion(int *nums, int numSize, int target) {
+    int i = 0, j = numSize - 1; // Initialize closed interval [0, n-1]
+    while (i <= j) {
+        int m = i + (j - i) / 2; // Calculate the midpoint index m
+        if (nums[m] < target) {
+            i = m + 1; // target is in the interval [m+1, j]
+        } else {
+            j = m - 1; // The first element less than target is in the interval [i, m-1]
+        }
+    }
+    // Return insertion point i
+    return i;
+}
+
+/* Binary search for the leftmost target */
+int binarySearchLeftEdge(int *nums, int numSize, int target) {
+    // Equivalent to finding the insertion point of target
+    int i = binarySearchInsertion(nums, numSize, target);
+    // Target not found, return -1
+    if (i == numSize || nums[i] != target) {
+        return -1;
+    }
+    // Found target, return index i
+    return i;
+}
+
+/* Binary search for the rightmost target */
+int binarySearchRightEdge(int *nums, int numSize, int target) {
+    // Convert to finding the leftmost target + 1
+    int i = binarySearchInsertion(nums, numSize, target + 1);
+    // j points to the rightmost target, i points to the first element greater than target
+    int j = i - 1;
+    // Target not found, return -1
+    if (j == -1 || nums[j] != target) {
+        return -1;
+    }
+    // Found target, return index j
+    return j;
+}
+
+/* Driver Code */
+int main() {
+    // Array with duplicate elements
+    int nums[] = {1, 3, 6, 6, 6, 6, 6, 10, 12, 15};
+    printf("\nArray nums = ");
+    printArray(nums, sizeof(nums) / sizeof(nums[0]));
+
+    // Binary search left and right boundaries
+    int targets[] = {6, 7};
+    for (int i = 0; i < sizeof(targets) / sizeof(targets[0]); i++) {
+        int index = binarySearchLeftEdge(nums, sizeof(nums) / sizeof(nums[0]), targets[i]);
+        printf("Leftmost element %d index is %d\n", targets[i], index);
+        index = binarySearchRightEdge(nums, sizeof(nums) / sizeof(nums[0]), targets[i]);
+        printf("Rightmost element %d index is %d\n", targets[i], index);
+    }
+
+    return 0;
+}