#include <stdio.h>
#include <stdlib.h>
#define N 10
void input(int a[],int n)
{
int i;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
return;
}
void swap(int *a ,int *b)
{
int t=*a;
*a=*b;
*b=t;
return;
}
void sort(int a[], int n)
{
register int i,j,max,m;
for(i=0;i<n-1;i++)
{
max=i;
for(j=i+1;j<n;j++)
{
if(a[max]<a[j])
{
max=j;
}
}
if(max!=i)
{
swap(&a[max],&a[i]);
}
}
}
void print(int a[],int n)
{
printf("%d",a[0]);
int i;
for(i=1;i<n;i++)
{
printf(" %d",a[i]);
}
printf("\n");
return;
}
int search(int a[], int n, int x)
{
int high = n - 1,low = 0;
int mid;
while(high >= low) {
mid = (high + low)/2;
if(a[mid] == x) return mid;
if(a[mid] < x) high = mid - 1;
else low = mid + 1;
}
return -1;
}
int main(int argc, char* argv[])
{
int a[N];
input(a,N);
sort(a,N);
print(a,N);
int x;
scanf("%d",&x);
int index=search(a,N,x);
if(index!=-1)
{
printf("%d\n",index);
}
else
{
printf("No %d was found\n",x);
}
system("pause");
return 0;
}
![](https://video.ask-data.xyz/img.php?b=https://iknow-pic.cdn.bcebos.com/03087bf40ad162d976a2cb9614dfa9ec8b13cde8?x-bce-process=image%2Fresize%2Cm_lfit%2Cw_600%2Ch_800%2Climit_1%2Fquality%2Cq_85%2Fformat%2Cf_auto)
![](https://video.ask-data.xyz/img.php?b=https://iknow-pic.cdn.bcebos.com/314e251f95cad1c8bff355ad7a3e6709c83d51eb?x-bce-process=image%2Fresize%2Cm_lfit%2Cw_600%2Ch_800%2Climit_1%2Fquality%2Cq_85%2Fformat%2Cf_auto)