#include <stdio.h>
void main()
{
         int a[] = {8,0,3,7,2,5}, i, j, t;
         i = 1;
         while ( i<6 )
         {
             t = a[i];
             j = i-1;
             while( j>=0 && t>a[j] )
            {
                  a[j+1] = a[j];
                  j--;
            }
            a[j+1] = t;
            i++;
         }
        i = 0;
        while(i<5)
             printf("%d,",a[i++]);
        printf("%d",a[i]);
}

当i=1,t=a[1]=0,j=1-1=0,中间循环不执行，a[j+1]=t,a[1]=0;
当i=2,t=a[2]=3,j=2-1=1，执行中间循环，a[j+1]=a[1+1]=a[1]=0,j--,j=0时循环执行结束，a[j+1]=a[0+1]=t=3
当i=3,t=a[3]=7,j=3-1=2,执行中间循环，j=2,a[3]=a[2]=3  j=1,a[2]=a[1]=3,j=0,循环结束，a[1]=t=7;
依次类推，一步一步，很放边算的，