C语言找有序数列中的数字并输出下标（折半查找法）

1.用函数的方法：# include <stdio.h>

# include <stdlib.h>
int bin_search(int arr[],int left ,int right, int key)
{
int mid = 0;
while (left <= right)
{
mid = left + (right - left) / 2;
if (arr[mid] > key)
{
right = right - 1;
}
else if (arr[mid] < key)
{
left = left + 1;
}
else
return mid;
}
return -1;
}
int main()
{
int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int key = 0;
int a = 0;
int left = 0;
int right = sizeof(arr) / sizeof(arr[0]);
printf("请输入你要找的数：");
scanf("%d", &key);
a = bin_search(arr, left, right, key);
if (a == -1)
printf("没有找到\n");
else
{
printf("找到了！！！下标是：%d\n", a);
}
system("pause");
return 0;

}

2.不使用函数：

int main()
{
 int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int left = 0;
int right = sizeof(arr) / sizeof(arr[0]);
int key = 0;
int mid = 0;
printf("请输入你要找的数字：\n");
scanf("%d", &key);
while (left <= right)
{
mid = left + (right - left) / 2;
if (arr[mid] > key)
{
right = right - 1;
}
else if (arr[mid] < key)
{
left = left + 1;
}
else
break;
}

if (left <= right)
printf("找到了！！！下标是：%d\n", mid);
else
printf("没有找到！！！\n");

system("pause");

       return 0;

}