二分查找法找无序数组中的元素

先用选择法排序将无序数组变升序，再用二分查找法。

#include <stdio.h>
//二分查找法，选择排序法将无序数组元素变有序
int main()
{
	int arr[10] = { 5,2,6,4,3,1,9,8,7,10 };
	//用选择排序法完成
	int temp = 0;
	for (int i = 0; i < 9; i++)
	{
		for (int j = i + 1; j < 10; j++)
		{
			if (arr[i] > arr[j])
			{
				temp = arr[i];
				arr[i] = arr[j];
				arr[j] = temp;
			}
		}
	}
	int x, mid;         //x是要查找的数,mid是中间值的下标
	int left = 0, right = 9;//left是坐下标，right是右下标
	scanf("%d", &x);  //输入查找数字
	int flag = 0;
	while (left <= right)
	{
		mid = (left + right) / 2;
		if (x == arr[mid])
		{
			flag = 1;
			break;
		}
		else if (x < arr[mid])
			right = mid - 1;
		else
			left = mid + 1;
	}
	if (flag == 1)
		printf("找到了，下标是：%d", mid);
	else
		printf("找不到！");
	return 0;
}