private int BinarySearch(){
        ArrayList<Word> list = this.listWord;
        int size = list.size() -1;
        int min = 0,max = size,mid;
        mid = (size/2);
        while(max > min){
            aWord = list.get(max);
             if(text.compareToIgnoreCase(aWord.getWord()) == 0 ){
                
                return max;
            }
            aWord = list.get(min);
            if(text.compareToIgnoreCase(aWord.getWord()) == 0){
                return min;
            }
            aWord = list.get(mid);
            if(text.compareToIgnoreCase(aWord.getWord()) == 0){
                return mid;
            }else if(text.compareToIgnoreCase(aWord.getWord()) < 0){
                max = mid-1;
                min = min + 1;
                mid = (int)(min+max)/2;
            }else if(text.compareToIgnoreCase(aWord.getWord()) > 0){
                min = mid+1;
                max = max -1;
                mid = (int)(min+max)/2;
            }
        }
        return -1;
    }