二进制查找(Binary Search)用于在已排序的数组中执行二进制查找的函数。
- int binary_search(int arr[], int size, int target) {
- int left = 0, right = size - 1;
- while (left <= right) {
- int mid = left + (right - left) / 2;
- if (arr[mid] == target) {
- return mid;
- } else if (arr[mid] < target) {
- left = mid + 1;
- } else {
- right = mid - 1;
- }
- }
- return -1; // Not found
- }
|