binsert.c

算法函数库 算法函数库

#include "stdio.h"
long number[100000000];
long n;
int main()
{
    
    long i,temp;
    long unsort,sort;
    long left,right,middle;
    printf("n=");
    scanf("%ld",&n);
    for(i=0;i<n;i++){scanf("%ld",&number[i]);}
    unsort=1;sort=0;
    for(;unsort<n;unsort++,sort++)
    {
        left=0;right=sort;
        while(left<=right)
        {
            middle=(left+right)/2;
            if(number[middle]>number[unsort]){right=middle-1;}
            else{left=middle+1;}
        }
        temp=number[unsort];
        for(i=unsort;i>left;i--){number[i]=number[i-1];}
        number[left]=temp;
    }
    for(i=0;i<n;i++){printf("%ld ",number[i]);if(i%10==0&&i!=0){printf("\n");}}
    system("pause");
    return 0;
}