private ArrayList<String[]> compareSets(ArrayList<String[]> setOne, ArrayList<String[]> setTwo, int checkingRound) {
	
	int progress = 0;
	boolean rowFound;
	ArrayList<Integer> foundRecords = new ArrayList<Integer>();
	ArrayList<String[]> disputes = new ArrayList<String[]>();
	
	for(int i = 0; i < setOne.size(); i++) {
	    
	    String[] setOneRow = setOne.get(i);
	    rowFound = false;
	    
	    for(int j = 0; j < setTwo.size(); j++) {
		
		//this section seemeed to have slow down the process a lot
		//it has been removed from the code for now
		//if a record is marked as found, skip over it
		//if(foundRecords.contains(j)) {
		    
		   // continue;
		//}
		
		String[] setTwoRow = setTwo.get(j);
		
		if(compareStringArray(setOneRow, setTwoRow)) {
		    
		    foundRecords.add(j);
		    rowFound = true;
		    //do not continue when a record is found
		    break;
		}
	    }
	    
	    if(!rowFound) {
		
		disputes.add(setOneRow);
	    }
	    
	    //calculate and update the progress bar
	    if(checkServerOne && checkServerTwo) {
		
		progress = (i*50)/setOne.size();
		progress = (checkingRound == 1) ? progress : progress + 50;
	    }
	    else {

		progress = (i*100)/setOne.size();
	    }
	    
	    mf.getCompData().setProgress(progress);
	    mf.getCompData().setProgressBarText(progress + "%");
	}
	
	return disputes;
    }