mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 14:26:29 +08:00
1e49574332
Use PascalCase for all structs in C. SImplify n_queens.c Format C code for chapter of graph.
47 lines
1.2 KiB
C
47 lines
1.2 KiB
C
/**
|
|
* File: binary_search_recur.c
|
|
* Created Time: 2023-10-01
|
|
* Author: Zuoxun (845242523@qq.com)
|
|
*/
|
|
|
|
#include "../utils/common.h"
|
|
|
|
/* 二分查找：问题 f(i, j) */
|
|
int dfs(int nums[], int target, int i, int j) {
|
|
// 若区间为空，代表无目标元素，则返回 -1
|
|
if (i > j) {
|
|
return -1;
|
|
}
|
|
// 计算中点索引 m
|
|
int m = (i + j) / 2;
|
|
if (nums[m] < target) {
|
|
// 递归子问题 f(m+1, j)
|
|
return dfs(nums, target, m + 1, j);
|
|
} else if (nums[m] > target) {
|
|
// 递归子问题 f(i, m-1)
|
|
return dfs(nums, target, i, m - 1);
|
|
} else {
|
|
// 找到目标元素，返回其索引
|
|
return m;
|
|
}
|
|
}
|
|
|
|
/* 二分查找 */
|
|
int binarySearch(int nums[], int target, int numsSize) {
|
|
int n = numsSize;
|
|
// 求解问题 f(0, n-1)
|
|
return dfs(nums, target, 0, n - 1);
|
|
}
|
|
|
|
/* Driver Code */
|
|
int main() {
|
|
int target = 6;
|
|
int nums[] = {1, 3, 6, 8, 12, 15, 23, 26, 31, 35};
|
|
int numsSize = sizeof(nums) / sizeof(nums[0]);
|
|
|
|
// 二分查找（双闭区间）
|
|
int index = binarySearch(nums, target, numsSize);
|
|
printf("目标元素 6 的索引 = %d\n", index);
|
|
|
|
return 0;
|
|
}
|