从一组数列中找出一个数的下标

#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int main()
{
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	int k = 7;
	int mid;
	int left =0;
	int sz = sizeof(arr) / sizeof(arr[0]);
	int right = sz-1;
	while (left <= right)
	{
		mid = (left + right) / 2;
		if (arr[mid] < k)
		{
			left = mid + 1;
		}
		else if (arr[mid] > k)
		{
			right = mid - 1;
		}
		else
		{
			printf("找到了,序号为：%d",mid);
			break;
		}
	}
	if (left > right)
		printf("找不到\n");
	return 0;
}

2.用函数表明上述操作

#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
int swap(int a[], int k,int s)//a[]参数其实传的是arr[0的地址，
{
	int left = 0;
	int right = s-1;
	while (left <= right)
	{int mid = (right + left) / 2;
		if (a[mid] < k)
		{
			left = mid + 1;
		}
		else if (a[mid] > k)
		{
			right = mid - 1;
		}
		else 
		{
			return mid;
		}
	}
	return -1;
}
int main()
{
	int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
	int key = 7;
	int sz = sizeof(arr) / sizeof(arr[0]);
	int game = swap(arr,key,sz);
	if (-1 == game)
	{
		printf("没找到啊");
	}
	else
	{
		printf("找到了，是序列%d", game);
	}
	return 0;
}