Pha Ooop
Pha Ooop
BinarySearch
public int binarySearch(int left,int right,String str){
if(right >= left){
int mid = left + (right - left) / 2;
if(tuDien.get(mid).getEn().compareTo(str)==0){
return mid;}
if(tuDien.get(mid).getEn().compareTo(str) >0 ){
return binarySearch(left, mid-1, str); }
return binarySearch(mid+1, right, str); }
return -1; }
Tìm kiếm dùng binarySearch
public String timKiem(String en){
sapXepTuDien();
int ketqua = binarySearch(0, tuDien.size()-1,
en);
if(ketqua != -1){
return tuDien.get(ketqua).getVn();
}
return "";
}