java插入排序Insertsort实例

//折半插入排序
voidBinaryInsertionSort(int*arr,intnLen)
{
   inti,j;
   intlow,mid,high;
   for(i=1;i<nLen;i++)
   {
       inttemp=arr[i];
       if(temp<arr[i-1])//这个判断可不要
       {
           low=0;
           high=i-1;
           while(low<=high)//error:while(low<high)注意这里还需要等号
           {
               mid=(low+high)/2;
               if(temp<arr[mid])
                   high=mid-1;
               else
                   low=mid+1;
           }
           //经过上面的折半查找插入位置后，这时插入位置为low或者high+1,这时low等于high+1
           //for(j=i-1;j>=high+1;j--)
           //{
           //   arr[j+1]=arr[j];
           //}
           //arr[high+1]=temp;

           for(j=i-1;j>=low;j--)
           {
               arr[j+1]=arr[j];
           }
           arr[low]=temp;
       }
   }
}