protected double checkWhetherDichotomous(double[] array){

        int n = array.length;
        double[] responseMatching = new double[n];
        boolean[] matchingCheck = new boolean[n];

        for(int i=0; i<n; i++){
            responseMatching[i] = 0.0;
            matchingCheck[i] = false;
        }

        for(int i=0; i<n; i++){
            responseMatching[i] = 0;
            for(int j=0; j<n; j++){
                if(array[i]==array[j] && !matchingCheck[j]){
                    responseMatching[i] += 1.0;
                    matchingCheck[j] = true;
                }
            }
        }

        ArrayMaths am0 = new ArrayMaths(responseMatching);
        ArrayMaths am1 = am0.sort();
        double[] sorted = am1.array();
        double max = (sorted[n-1] + sorted[n-2])*100.0/((double)n);
        return max;
    }