//对数组{1,3,9,5,6,7,15,4,8}进行排序,然后使用二分查找 6 并输出排序后的下标。
System.out.println("-------------");
int[] one={1,3,9,3,5,6,7,15,4,8};
int temp;
//进行冒泡排序
for (int i = 0; i < one.length; i++) {
for (int j =i+1; j < one.length; j++) {
if (one[j]<one[i]){
temp=one[j];
one[j]=one[i];
one[i]=temp;
}
}
}
for (int i = 0; i < one.length; i++) {
System.out.print(one[i]+" ");
}
//进行二分查找
int maxIndex=one.length-1;
int minIndex=0;
int centerIndex=(maxIndex+minIndex)/2;
int six=6;
while (true)
{
if (six>one[centerIndex]){
//目标数比中间数大时
minIndex=minIndex+1;
}else if (six<one[centerIndex]){
//目标数比中间数小时
maxIndex=maxIndex-1;
}else{
System.out.println("找到了下标为" +centerIndex);
break;
}
if (minIndex>maxIndex){
System.out.println("找不到此数");
break;
}
centerIndex=(maxIndex+minIndex)/2;
}
冒泡排序的比较
二分查找:通俗的讲就是一半一半的找。