Search returning 0

    public int binarySearch(int toFind)
    {
        int pos = -1;
        if(isSorted()){
            int upperBound = list.length-1;
            int lowerBound = 0;
            pos = (lowerBound + upperBound)/2;
            int num = list[pos];
            while((num!=toFind)&&(lowerBound<=upperBound)){
                if(num>toFind){
                    upperBound = pos-1;
                }else{
                    lowerBound = pos+1;
                }
                pos = (lowerBound + upperBound)/2;
            }
        }
        return pos;
    }