typedef int SortData; void BinInsSort( SortData VI, int n)i SortData temp; int Left, Right for(int i=1;i<n; i++i Left=0; Right=i-l; temp=v: while( left<= right i int mid=( Left right )/2; if temp < Mid])Right= mid-1 else left= mid +1. for (int k=i-l; k>= Left; k--)V[k+1= vk; / 记录后移 vLef=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; //插入 } }