void    BinSort (RecordType  r[],  int length)
/*對記錄數組r進行折半插入排序，length為數組的長度*/
{
	int i,j;
	RecordType x;
	int low,high,mid;
	for (  i=2; i<=length ; ++i ) 
	{
		x= r[i];
		low=1;  high=i-1;
		while (low<=high )                  /* 確定插入位置*/ 
		{
			mid=(low+high) / 2;
			if (  x.key< r[mid].key   )    
				high=mid-1;
			else 
				low=mid+1;
		}
		for (  j=i-1 ; j>= low; --j )   r[j+1]= r[j];         /*  記錄依次向后移動 */ 
		r[low]=x;                                                            /* 插入記錄 */ 
	}
}/*BinSort*/