📄 search2.java
字号:
public class Search
{
static int binarysearch(int a[],int key)
{
int left=0;
int right=a.length-1;
int middle;
while (left<=right)
{
middle=(left+right)/2
if (key==a[middle]) return middle;
else if (key<a[middle]) right=middle-1;
else left=middle+1;
}
return -1;
}
public static void main(String args[])
{
int a[]={25,36,47,32,21,16};
int key=Integer.parseInt(args[0]);
int k=binarysearch(a,key);
if (k!=-1)
System.out.println(k);
else
System.out.println("not found");
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -