/** * File: binary_search.c * Created Time: 2023-03-18 * Author: Guanngxu (446678850@qq.com) */ #include "../utils/common.h" /* Binary search (double closed interval) */ int binarySearch(int *nums, int len, int target) { // Initialize double closed interval [0, n-1], i.e., i, j point to the first element and last element of the array respectively int i = 0, j = len - 1; // Loop until the search interval is empty (when i > j, it is empty) while (i <= j) { int m = i + (j - i) / 2; // Calculate midpoint index m if (nums[m] < target) // This situation indicates that target is in the interval [m+1, j] i = m + 1; else if (nums[m] > target) // This situation indicates that target is in the interval [i, m-1] j = m - 1; else // Found the target element, thus return its index return m; } // Did not find the target element, thus return -1 return -1; } /* Binary search (left closed right open interval) */ int binarySearchLCRO(int *nums, int len, int target) { // Initialize left closed right open interval [0, n), i.e., i, j point to the first element and the last element +1 of the array respectively int i = 0, j = len; // Loop until the search interval is empty (when i = j, it is empty) while (i < j) { int m = i + (j - i) / 2; // Calculate midpoint index m if (nums[m] < target) // This situation indicates that target is in the interval [m+1, j) i = m + 1; else if (nums[m] > target) // This situation indicates that target is in the interval [i, m) j = m; else // Found the target element, thus return its index return m; } // Did not find the target element, thus return -1 return -1; } /* Driver Code */ int main() { int target = 6; int nums[10] = {1, 3, 6, 8, 12, 15, 23, 26, 31, 35}; /* Binary search (double closed interval) */ int index = binarySearch(nums, 10, target); printf("Index of target element 6 = %d\n", index); /* Binary search (left closed right open interval) */ index = binarySearchLCRO(nums, 10, target); printf("Index of target element 6 = %d\n", index); return 0; }