数据结构之插入排序

 1 void directInsertSort(int Arr[], int n)
 2 {
 3     int i, j, temp;
 4     for (i = 1; i<n-1; i++)
 5     {
 6         if(Arr[i] < Arr[i-1])
 7         {
 8             j = i - 1;
 9             temp = A[i];
10             while(j >= 0 && temp < Arr[j])
11             {
12                 Arr[j+1] = Arr[j];
13                 j--;
14             }
15             Arr[j+1] = temp;
16         }
17     }
18 }

 1 void BinInsertSort(int Arr[], int n)
 2 {
 3     int i, j, low, high, mid, temp;
 4     for(i = 1; i <= n-1; i++)
 5     {
 6         temp = Arr[i];
 7         low = 0;
 8         high = i - 1;
 9         while(low <= high)
10         {
11             mid = (low + high)/2;
12             if(temp > Arr[mid])
13                 low = mid - 1;
14             else
15                 high = low + 1;
16         }
17         for(j = 1; j > low; j--)
18             Arr[j] = Arr[j-1];
19     }
20 }