二分查找

#include<stdio.h>
#include<stdlib.h>

/*
int low = 0, high = 9, num, count = 0, cnt = 0, mid;
scanf_s("%d", &num);
while (low <= high) {
	cnt++;
	mid = (low + high) / 2;
	if (a[mid] > num) {
		high = mid - 1;
	}
	else if (a[mid] < num) {
		low = mid + 1;
	}
	else if (num == a[mid]) {
		count++;
		printf("查找成功,查找次数%d，下标是%d\n", cnt, mid);
		break;
	}
}
if (count == 0) {
	printf("查找失败\n");
}
*/
//二分查找过程模拟
int binary_search(int a[], int length, int num) {
	int low = 0, high = length-1;
	int mid;
	while (low <= high) {
		mid = (low + high) / 2;
		if (num > a[mid]) {
			low = mid + 1;
		}
		else if(num<a[mid]){
			high = mid - 1;
		}
		else {
			return mid;
		}
	}
	return -1;
}

int main() {
	int a[10] = { 12,5,3,6,8,9,2,34,4,7 };
	for (int i = 0; i < 10; i++) {
		printf("%4d", a[i]);
	}
	printf("\n--------------------------------------\n冒泡排序后的数组为:\n");
	int max;
	//二分查找是针对有序表(递增)进行的，首先对一位数组进行排序（冒泡排序）
	for (int i = 0; i < 9; i++) {
		for (int j = i + 1; j < 10; j++) {
			max = i;
			if (a[max] < a[j]) {
				max = j;
			}
			if (max != j) {
				int temp = a[j];
				a[j] = a[max];
				a[max] = temp;
			}
		}
	}
	for (int i = 0; i < 10; i++) {
		printf("%4d",a[i]);
	}
	printf("\n请输入待查数据:\n");
	int num;
	scanf_s("%d", &num);
	if (binary_search(a, 10, num) == -1) {
		printf("查找失败\n");
	}
	else {
		printf("数字:%d 查找成功,下标为:%d\n", num, binary_search(a, 10, num));
	}
	
	return 0;
}