package com.demo;
import java.util.Arrays;
public class Demo06 {
public static void main(String[] args) {
//排序 查找
//二分法查找 有序数列
int[] is = {10,20,30,40,100};
Arrays.sort(is);
for(int num:is){
System.out.print(num +" ");
}
myBinarySort(is,30);
System.out.println( myBinarySort(is,30));
}
//从is 查找num 是否存在 如果存在 输出index 如果没有 -1
public static int myBinarySort(int[] is,int num ){
int low = 0;
int high = is.length-1;
while(low<high){
int mid = (low+high)/2;
if(is[mid]>num){
high = mid-1;
}else if(is[mid]<num){
low = mid + 1;
}else{
return mid;
}
}
return -1;
}
}
import java.util.Arrays;
public class Demo06 {
public static void main(String[] args) {
//排序 查找
//二分法查找 有序数列
int[] is = {10,20,30,40,100};
Arrays.sort(is);
for(int num:is){
System.out.print(num +" ");
}
myBinarySort(is,30);
System.out.println( myBinarySort(is,30));
}
//从is 查找num 是否存在 如果存在 输出index 如果没有 -1
public static int myBinarySort(int[] is,int num ){
int low = 0;
int high = is.length-1;
while(low<high){
int mid = (low+high)/2;
if(is[mid]>num){
high = mid-1;
}else if(is[mid]<num){
low = mid + 1;
}else{
return mid;
}
}
return -1;
}
}