public void quicksort(int s, int t){
    	int temp = candidates[s];
    	int i = s, j = t;
    	while(i < j){
    		while(i < j && candidates[j] > temp) j--;
    		if(i < j){
    			candidates[i] = candidates[j];
    			i++;
    		}
    		while(i < j && candidates[i] < temp) i++;
    		if(i < j){
    			candidates[j] = candidates[i];
    			j--;
    		}
    	}
    	candidates[i] = temp;
    	if(s < i - 1) quicksort(s, i - 1);
    	if(i + 1 < t) quicksort(i + 1, t);
    }