插入排序

 #include<stdio.h>
void insertsort(int a[],int n)
{
           int i,j,t;
          for(i=1;i<n;i++)
          {
                      j=i;
                      t=a[i];
                      while(j,t<a[j-1])
                      {
                                a[j]=a[j-1];
                                 j--;
                      }
                     a[j]=t;
           }
} 
int main()
{
           int a[100];
           int n,i;
           while(scanf("%d",n)!=EOF,n)
           {
                        for(i=0;i<n;i++)
                        scanf("%d",&a[i]);
                        insertsort(a,n);
                        for(i=0;i<n;i++)
                        printf("%d ",a[i]);
                        printf("\n");
           }
          return 0;
}
 插入排序思想很简单从后往前遍历如果是排升序遇到比它小的在那个数之后插入