Insert sort directly

Direct insert sort

 

/*  Yes   along   order   surface  L  do   straight   Pick up   insert   Enter into   row   order  */
 void InsertSort ( SqList *L){
     int i, j;
     for (i = 2; i <= L- > length ; i++) {
         /*  Need to be   take L- >r[i]  insert   Enter into   Yes   order   Son   surface  */
         if (L->r[i] < L- >r[i - 1]) {
             /*  set up   Set up   whistle   The soldiers  */
             L->r [0] = L- >r[i];
             for (j = i - 1; L- >r[j] > L- >r [0]; j - -)
                 /*  remember   record   after   move  */
                 L- >r[j + 1] = L- >r[j];
             /*  insert   Enter into   To   just   indeed   position   Set up  */
             L->r[j + 1] = L->r [0];
                 }
         }
 }