二分插入排序+二分搜索

#include <cstdio>
#include <cstdlib>
#include <ctime>
const int N=100;
int n=50,step;
int in[N];
void binsort()
{
    int l,r,id;
    for (int i=1;i<n;i++)
    {
        l=0;r=i-1;int temp=in[i];
        while (l<=r)
        {
            int mid=(l+r)/2;
            if (temp<in[mid])
            {
                r=mid-1;
            }
            else
            {
                l=mid+1;
            }
        }
        for (int j=i-1;j>=l;j--)
        {
            in[j+1]=in[j];
        }
        in[l]=temp;
    }
}
int binsearch(int want)
{
    int l,r,mid;
    l=0;r=n-1;
    while (l<=r)
    {
        step++;
        mid=(l+r)/2;
        if (in[mid]==want)
        {
            return 1;
        }
        else if (in[mid]>want)
        {
            r=mid-1;
        }
        else
        {
            l=mid+1;
        }
    }
    return 0;
}
int main()
{
    srand(time(0));
    for (int i=0;i<n;i++)
    {
        in[i]=rand()%100;
        printf("%d ",in[i]);
    }
    printf("
");
    binsort();
    for (int i=0;i<n;i++)
    {
        printf("%d ",in[i]);
    }
    printf("
");
    int ans,want;
    step=0;
    scanf("%d",&want);
    ans=binsearch(want);
    printf("%d step:%d
",ans,step);//注意不能写成printf("%d step:%d
",binsearch(want),step);!!! 

    return 0;
}