查找算法相关

二分查找法

#include<stdio.h>

int Binary_Search(int[], int, int);
int main()
{
	int a[10];
	int n, des;
	printf("您要输入多少个数？：\n");
	scanf_s("%d", &n);
	printf("请输入%d个数据\n", n);
	for (int i = 0; i < n; i++) {
		scanf_s("%d", &a[i]);
	}
	printf("请输入您要找的数：\n");
	scanf_s("%d", &des);
	printf("您要找的数的下标为：%d\n", Binary_Search(a, n, des));
	return 0;
}
int Binary_Search(int nums[], int numsSize, int target) {
	int low = 0, high = numsSize - 1, mid;
	while (low <= high) {
		mid = (low + high) / 2;
		if (nums[mid] > target) {
			high = mid - 1;
		}
		else if (nums[mid] < target) {
			low = mid + 1;
		}
		else {
			return mid;
		}
	}
	if (low > high) {
		printf("您要找的数不在数组中");
	}

}

输入：

10

1 2 3 4 5 6 7 8 9 10

4

输出:3

时间复杂度分析

决定于while的循环次数，二分查找的最坏情况是一直找到最后一个元素。假设共有n个数，一次折半后还剩n/2个数...k次折半后还剩下n/(2^k)个元素，即n/(2^k)=1，则k=log2n