二分法排序

01.void BinInsertSort(int a[], int n)   
02.{   
03.        int key, left, right, middle;   
04.        for (int i=1; i<n; i++)   
05.        {   
06.                key = a[i];   
07.                left = 0;   
08.                right = i-1;   
09.                while (left<=right)   
10.                {   
11.                        middle = (left+right)/2;   
12.                        if (a[middle]>key)   
13.                                right = middle-1;   
14.                        else   
15.                                left = middle+1;   
16.                }   
17.                   
18.                for(int j=i-1; j>=left; j--)   
19.                {   
20.                        a[j+1] = a[j];   
21.                }   
22.                   
23.                a[left] = key;          
24.        }   
25.}