用递归函数巧妙实现二分查找，代码解析与示例展示

```c #include <stdio.h> int binary_search_rec(int a[], int left, int right, int target) { if (left > right) { return -1; } int mid = left + (right - left) / 2; if (a[mid] == target) { return mid; } else if (a[mid] > target) { return binary_search_rec(a, left, mid - 1, target); } else { return binary_search_rec(a, mid + 1, right, target); } } int main() { int a[7] = {0, 1, 2, 3, 5, 6, 7}; for (int num = 0; num < 8; num++) { printf("search %d: index:%d\n", num, binary_search_rec(a, 0, 6, num)); } return 0; } ``` ######[AI写代码神器 | 248点数解答 | 2024-10-17 10:29:01]