数据结构-顺序查找、二分查找

代码实现：

#include <stdio.h>

int seqSearch(int arr[],int n,int item)//顺序查找
{
	int i=0;
	for(i=0;i<n;i++)
	{
		if(arr[i]==item)
		{
			return i;
		}
	}
	return -1;
}
//二分查找
int binSearch(int arr[],int n,int item)
{
	int low=0;
	int high=0;
	int mid=0;
	while(low<=high)
	{
		mid=(low+high)/2;
		if(arr[mid]==item)
		{
			return mid;
		}else if(arr[mid]>item)
		{
			high=mid-1;
		}else if(arr[mid]<item)
		{
			low=mid+1;
		}

	}
	return -1;
}
int main(void)
{
	int arr[8]={12,32,43,54,65,76,87,98};
	int item;
	int i=0;
	printf("请输入需要查找的数字\n");
	scanf("%d",&item);
	//seqSearch(arr[0],8,item);//顺序查找
	binSearch(arr,8,item);
	return 0;
}