二分法
伪代码:
- 设置初始查找分区:low = 1; high=n;
- 测试查找区间 [low,high]是否存在,若不存在,则查找失败;
- 取中间位置mid = (low+high)/2;比较k与r[mid],有一下三种情况:
3.1 若k<r[mid],则high=mid-1;查找再左半区进行,转第2步;
3.2 若k>r[mid],则low=mid+1;查找在右半区进行,转第2步;
3.3若k=r[mid],则查找成功,返回记录在表中位置mid;
例题:
输入三个数字,n, m, k。数字 n<mk位于n和m之间。在数字n和m之间查找k值,输出查找的次数。
递归方法:
代码:
import java.util.ArrayList;
import java.util.Scanner;
public class search {
```
public static void main(String[] args) {
// TODO Auto-generated method stub
ArrayList<Integer> list = new ArrayList<>();
Scanner input = new Scanner(System.in);
int n, m, k, c =1;
n = input.nextInt();
m = input.nextInt();
k = input.nextInt();
System.out.println(binSearch(n, m, k,c));
}
private static int binSearch(int n, int m, int k,int c) {
// TODO Auto-generated method stub
int d = (n+m)/2;
if(d<k) {
return binSearch(d, m, k, c+1);
}
else if(d>k) {
return binSearch(n, d, k, c+1);
}
else
return c;
}
}
输出结果
非递归:
import java.util.ArrayList;
import java.util.Scanner;
public class lx01 {
public static void main(String[] args) {
// TODO Auto-generated method stub
ArrayList<Integer> list = new ArrayList<>();
Scanner input = new Scanner(System.in);
int n, m, k, c =1;
n = input.nextInt();
m = input.nextInt();
k = input.nextInt();
System.out.println(binSearch(n, m, k,c));
}
private static int binSearch(int n, int m, int k,int c) {
// TODO Auto-generated method stub
int d = (n+m)/2;
while(d != k) {
if(d<k) {
d = (d+m)/2;
c++;
}
else if(d>k) {
d = (d+n)/2;
c++;
}
else
c=c;
}
return c;
}
}