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-01 20: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,49 @@
+// File: binary_search_insertion.go
+// Created Time: 2023-08-23
+// Author: Reanon (793584285@qq.com)
+
+package chapter_searching
+
+/* Binary search for insertion point (no duplicate elements) */
+func binarySearchInsertionSimple(nums []int, target int) int {
+	// Initialize closed interval [0, n-1]
+	i, j := 0, len(nums)-1
+	for i <= j {
+		// Calculate the midpoint index m
+		m := i + (j-i)/2
+		if nums[m] < target {
+			// target is in the interval [m+1, j]
+			i = m + 1
+		} else if nums[m] > target {
+			// target is in the interval [i, m-1]
+			j = m - 1
+		} else {
+			// Found target, return insertion point m
+			return m
+		}
+	}
+	// Target not found, return insertion point i
+	return i
+}
+
+/* Binary search for insertion point (with duplicate elements) */
+func binarySearchInsertion(nums []int, target int) int {
+	// Initialize closed interval [0, n-1]
+	i, j := 0, len(nums)-1
+	for i <= j {
+		// Calculate the midpoint index m
+		m := i + (j-i)/2
+		if nums[m] < target {
+			// target is in the interval [m+1, j]
+			i = m + 1
+		} else if nums[m] > target {
+			// target is in the interval [i, m-1]
+			j = m - 1
+		} else {
+			// The first element less than target is in the interval [i, m-1]
+			j = m - 1
+		}
+	}
+	// Return insertion point i
+	return i
+}