1.二分查找(折半查找)
//二分查找
#include<stdio.h>
int main()
{
int arr[] = { 1,2,3,4,5,6 };
int left = 0, right = sizeof(arr) / sizeof(arr[0]) - 1, midIndex;
int value = 5;//待查找数据
while (left <= right)
{
midIndex=(left + right) / 2;
if (arr[midIndex] == value)
{
printf("%d 位于%d 号坐标\n", value, midIndex);
break;
}
else if (arr[midIndex] > value)
{
right = midIndex - 1;
}
else
{
left = midIndex + 1;
}
}
}