/** * File: binary_search.cs * Created Time: 2022-12-23 * Author: haptear (haptear@hotmail.com) */ namespace hello_algo.chapter_searching; public class binary_search { /* Binary search (closed interval) */ int BinarySearch(int[] nums, int target) { // Initialize the closed interval [0, n-1], with i and j pointing to the first and last elements int i = 0, j = nums.Length - 1; // Loop until the search interval is empty (when i > j) while (i <= j) { int m = i + (j - i) / 2; // Calculate the midpoint index m if (nums[m] < target) // In this case, target must be in [m+1, j] if it exists i = m + 1; else if (nums[m] > target) // In this case, target must be in [i, m-1] if it exists j = m - 1; else // The target element was found; return its index return m; } // The target element was not found; return -1 return -1; } /* Binary search (left-closed, right-open interval) */ int BinarySearchLCRO(int[] nums, int target) { // Initialize the left-closed, right-open interval [0, n), with i at the first element and j one past the last int i = 0, j = nums.Length; // Loop until the search interval is empty (when i = j) while (i < j) { int m = i + (j - i) / 2; // Calculate the midpoint index m if (nums[m] < target) // In this case, target must be in [m+1, j) if it exists i = m + 1; else if (nums[m] > target) // In this case, target must be in [i, m) if it exists j = m; else // The target element was found; return its index return m; } // The target element was not found; return -1 return -1; } [Test] public void Test() { int target = 6; int[] nums = [1, 3, 6, 8, 12, 15, 23, 26, 31, 35]; /* Binary search (closed interval) */ int index = BinarySearch(nums, target); Console.WriteLine("Index of target element 6 = " + index); /* Binary search (left-closed, right-open interval) */ index = BinarySearchLCRO(nums, target); Console.WriteLine("Index of target element 6 = " + index); } }