线性查找:
import java.util.Scanner;
public class verst {
public static void main(String[] args) {
// TODO 自动生成的方法存根
String arr[]=new String[]{"aa","bb","cc","dd","ee"};
for(int i=0;i<arr.length;i++)
{
System.out.print(arr[i]+" ");
}
String arr2="cc";
System.out.println();
boolean isflag=true;
for(int i=0;i<=arr.length;i++)
{
if(arr2.equals(arr[i]))
{
System.out.print("找到指定元素,位置为 "+i);
isflag=false;
}
}
if(isflag==true)
{
System.out.print("未找到指定元素");
}
}
}
二分查找:
public class verst {
public static void main(String[] args) {
// TODO 自动生成的方法存根
int arr[]=new int[]{2,21,26,29,50,66,77,88,99,101};
for(int i=0;i<arr.length;i++)
{
System.out.print(arr[i]+" ");
}
int arr2=26;
System.out.println();
boolean isflag=true;
int head = 0;
int end = arr.length-1;
while(head<=end)
{
int mid =(head+end)/2;
if(arr2==arr[mid])
{
System.out.print("找到指定元素 ,位置是: "+mid);
isflag=false;
break;
}
else if(arr2<arr[mid])
{
end=mid-1;
}else if(arr2>arr[mid])
{
head=mid+1;
}
}
if(isflag==true)
{
System.out.print("未找到指定元素");
}
}
}