冒泡排序及二分查找

#include<stdio.h>
#define SIZE 6
void bubbleSort(int b[]);
int bianySearch(int searchKey, int b[], int high, int low);
int main(void)
{
	int i, element, key;
	int a[SIZE];
	for (int i = 0; i < 6; i++){
		scanf_s("%d", &a[i]);
	}

	bubbleSort(a);
	printf("Enter the key: \n");
	scanf_s("%d", &key);

	element = bianySearch(key, a, SIZE - 1, 0);
	if (element != -1)
	{
		printf("%d\n", element);
	}
	else{
		printf("not found the searchKey");
	}
	return 0;
}

void bubbleSort(int b[])
{
	int i;
	int hold;
	int pass;
	for (pass = 1; pass <= SIZE; pass++)
	{
		for (i = 0; i < SIZE - 1; i++)
		{
			if (b[i]>b[i + 1])
			{
				hold = b[i];
				b[i] = b[i + 1];
				b[i + 1] = hold;
			}
		}
	}
	for (i = 0; i < SIZE; i++)
	{
		printf("%4d", b[i]);
	}
}

int bianySearch(int searchKey, int b[], int high, int low)
{
	int mid;
	while (low <= high)
	{
		mid = (low + high) / 2;
		if (searchKey == b[mid]){
			return mid;
		}
		else if (searchKey < b[mid])
		{
			high = mid - 1;
		}
		else{
			low = mid + 1;
		}
	}
	return -1;
}

关于scanf和数组
1.输入字符数组：
char a[SIZE];
scanf("%s",a);
2.输入数组：
int a[SIZE];
for (i=0;i<SIZE;i++)
{
scanf("%d",&a[i]);
}