Description
采用选择法对15个整数排序,排序完成后各整数按照从大到小的顺序排列。排序完成后输入一个数,要求用折半查找法找出该数是数组中第几个元素的值。
Sample Input
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
15
Sample Output
#include<iostream>
#include<algorithm>
using namespace std;
bool compare(int a,int b)
{
return a>b;
}
int s[20];
int serch(int k)
{
int low,mid,high;
low=0;
high=14;
while(low<=high)
{
mid=(low+high)/2;
if(s[mid]==k) return mid+1;
else if(s[mid]<k) high=mid-1;
else low=mid+1;
}
return 0;
}
int main()
{
int i,k;
for(i=0;i<15;i++)
cin>>s[i];
sort(s,s+15,compare);
cin>>k;
if(serch(k)==0) cout<<"wucishu!"<<endl;
else cout<<serch(k)<<endl;
return 0;
}