typedef int SortData; void BinInssort( SortData VI, int n)i SortData temp; int Left, Right; for(int i=l; i< n; i++)i Left=0; Right=i-1; temp= v; while( left < right)i int mid=( Left Right )/2 if( temp <VImid)right=mid-1 else Left= mid +1 for (int k=i-1; k>= Left; k--)VIk+1=VIk 记录后移 VLLeft=temp;插入typedef int SortData; void BinInsSort ( SortData V[ ], int n ) { SortData temp; int Left, Right; for ( int i = 1; i < n; i++) { Left = 0; Right = i-1; temp = V[i]; while ( Left <= Right ) { int mid = ( Left + Right )/2; if ( temp < V[mid] ) Right = mid - 1; else Left = mid + 1; } for ( int k = i-1; k >= Left; k-- ) V[k+1] = V[k];// 记录后移 V[Left] = temp; //插入 } }