#include<iostream>
#include<stdio.h>
using namespace std;
int search(int s[],int n,int key)
{
int low=0;int high=n-1;
int mid;
while(low<high)
{ mid=(low+high)/2;
if(s[mid]==key)
return s[mid];
else if(s[mid]>key)
high=mid-1;
else
low=mid+1;
}if(low>high)
return false;
}
void path(int s[],int n)
{
int i,j;int temp;
for(i=0;i<n;i++)
{
for(j=0;j<n-i-1;j++)
{
if(s[j]>s[j+1])
{
temp=s[j];
s[j]=s[j+1];
s[j+1]=temp;
}
}
}
for(i=0;i<n;i++)
printf("%d",s[i]);
}
void insert(int s[],int n,int key)
{
int i=0,temp,j;
if(s[0]>key)
{
for(i=n;i>=0;i--)
s[i+1]=s[i];
s[0]=key;
}
if(s[n-1]<key)
{
s[n]=key;}
while(i<n)
{
if(key>s[i]&&key<s[i+1])
{
for(j=n-1;j>i;j--)
s[j+1]=s[j];
s[i+1]=key;
}
i++;
}
}
int main()
{
int s[6];int key;
int i,num;
printf("输入5个数/n");
for(i=0;i<5;i++)
scanf("%d",&s[i]);
path(s,5);
printf("输入关键数/n");
scanf("%d",&key);
num=search(s,5,key);
if(num)
{ printf("%d/n",num);}
else
{printf("查找失败");
insert(s,5,key);
for(i=0;i<6;i++)
printf("%d",s[i]);
}
int tt;cin>>tt;
return 0;
}