二分查找C语言

void search(int *a, int n, int m){
	int begin, end, mid;
	begin = 0;
	end = n - 1;
	
	while (begin <= end){
		mid = (begin + end) / 2;
		if (a[mid] == m){
			printf("已找到 下标为%dn", mid);
			break;
		}
		else {
			if (a[mid] > m) end = mid - 1;
			else begin = mid + 1;
		}
	}
	
	if(begin>end) printf("未找到n");
	

}
int main(){
	int a[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
	search(a, 10, 4);
	return 0;
}

运行效果