大学笔记-二分查找算法

思想：将N个元素分别分成个数大致相同的两半，取中间a[n/2]，如果x=a[n/2]，则找到x，算法终止，如果x<a[n/2]，则在a[n]的左半部分继续查找x，如果x>a[n/2]，则在a[n]的右半部分继续查找，递归执行此算法。

#include<stdio.h>
#include<math.h>

void sort(int a[],int n)// sort fuction
{
int i,j,k;
int m;
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}
printf("\n");
for(j=0;j<n-1;j++)
{
for(k=j+1;k<n;k++)
{
if(a[j]>a[k])
{
m=a[j]; a[j]=a[k];a[k]=m;
}
}
}
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}

}

int BinarySearch(int a[],int x,int n)//index fuction
{
int left=0;
int right=n-1;
int mid;
while(left<=right)
{
mid=(left+right)/2;
if(x==a[mid]) return mid;
if(x>a[mid])
left=mid+1;
else
right=mid-1;
}
return -1;//the data is not found
}
void main()
{
int i;
int a[10]={1,3,5,10,6,9,11,2,20,14};
sort(a,10); //order

printf("\nplease input the data you want to find \n");
scanf("%d",&i);

if(BinarySearch(a,i,10)==-1)
{
printf("the data is not found \n");
}
else
{
printf("the data address is:");
printf("%d\n",BinarySearch(a,i,10));
printf("the data is:\n");
printf("%d\n",a[BinarySearch(a,i,10)]);
}

}