二叉排序法

int main6()//二叉排序法  
{
int a[5] = {2,1,3,4,6};
int len = sizeof(a)/sizeof(a[0]);
int i,j,get;

for(i=1;i<len;i++)
{
int left = 0;
   int right = i-1;
get = a[i];
j = i-1;
while(left == right)//找插入点
{
int mid = (left+right)/2;
if(a[mid]>get)
right = mid - 1;
else
left = mid + 1;
}//左右移动
for(j =i-1;j>len;j--)
{
a[j+1] = a[j];
}//插入点右面的元素向右移
a[left] = get;
}
printA(a,len);
}