package Test;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
public class listTest1 {
public static void main(String[] args)
{
// TODO Auto-generated method stub
binarySearchDemo();
}
public static void binarySearchDemo()
{
List<String> list=new ArrayList<String>();
list.add("abcd");
list.add("aaaa");
list.add("zz");
list.add("kkkerek");
list.add("qq");
list.add("z");
System.out.println(list);
int index=halfSearch(list,"abcde");
System.out.println("index="+index);
}
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
public class listTest1 {
public static void main(String[] args)
{
// TODO Auto-generated method stub
binarySearchDemo();
}
public static void binarySearchDemo()
{
List<String> list=new ArrayList<String>();
list.add("abcd");
list.add("aaaa");
list.add("zz");
list.add("kkkerek");
list.add("qq");
list.add("z");
System.out.println(list);
int index=halfSearch(list,"abcde");
System.out.println("index="+index);
}
public static int halfSearch(List<String> list,String key)
{
int max,min,mid;
max=list.size()-1;
min=0;
while(min<=max)
{
mid=(max+min)>>1;
String str=list.get(mid);
int num=str.compareTo(key);
if(num>0)
max=mid-1;
else if(num<0)
min=mid+1;
else return mid;
}
return min;
}
}