二分查找

递归：

#include<iostream>
using namespace std;
void bubblesort(int a[],int n)
{
	int i,j,t;
	for(i=n-1;i>=0;i--)
	{
		int flag=0;
		for(j=0;j<i;j++)
		{
			if(a[j]>a[j+1])
			{
				t=a[j];
				a[j]=a[j+1];
				a[j+1]=t;
				flag=1;
			}
		}
		if(flag==0) return;
	}
}
int binarysearch(int a[],int low,int high,int m)
{
	int middle=(low+high)/2;
	if(low>high) return -1;
	if(m==a[middle]) return middle;
	else if(m<a[middle]) return binarysearch(a,low,middle-1,m);
	else return binarysearch(a,middle+1,high,m);
}
int main()
{
	int n,m,i,a[101];
	cin>>n>>m;
	for(i=0;i<n;i++) cin>>a[i];
	bubblesort(a,n);
	cout<<binarysearch(a,0,n-1,m)<<endl;
	return 0;
}

非递归：

#include<iostream>
using namespace std;
void bubblesort(int a[],int n)
{
	int i,j,t;
	for(i=n-1;i>=0;i--)
	{
		int flag=0;
		for(j=0;j<i;j++)
		{
			if(a[j]>a[j+1])
			{
				t=a[j];
				a[j]=a[j+1];
				a[j+1]=t;
				flag=1;
			}
		}
		if(flag==0) return;
	}
}
int binarysearch(int a[],int low,int high,int m)
{
	int middle;
	while(low<high)
	{
		middle=(low+high)/2;
		if(m==a[middle]) return middle;
		else if(m>a[middle]) low=middle+1;
		else high=middle-1;
	}
	return -1;
}
int main()
{
	int n,m,i,a[101];
	cin>>n>>m;
	for(i=0;i<n;i++) cin>>a[i];
	bubblesort(a,n);
	cout<<binarysearch(a,0,n-1,m)<<endl;
	return 0;
}