排序算法之折半排序
public class bininsertsort
{
public static void printArray(int[] num) {
for(int i : num) {
//遍历数组
System.out.printf("%d\t", i);
}
System.out.println();}
public static void main(String []args)
{
int i,j,low,high,mid,tmp;
int num[]= {
6,5,1,2,0,8,7,9,3,4,10};
mid=0;tmp=0;//这里一定要置为0,不然报错
for(i=1;i<num.length;i++)
{
if(num[i]<num[i-1])
{
tmp=num[i];
low=0;
high=i-1;
while(low<=high)
{
mid=(low+high)/2;
if(tmp<num[mid])
high=mid-1;
else
low=mid+1;
}
for(j=i-1;j>=high+1;j--)
num[j+1]=num[j];
num[high+1]=tmp;
}
printArray(num);
}
printArray(num);
}
}
平均时间复杂度:O(n^2)。