public int[][] findGroups(int upperPercentLimit){
		int largest = findLargestInt();
		int size = 0;
		for(int i = 0; i < inputTable.length; i++){
			for(int j = 0; j < i; j++){
				if(inputTable[i][j]/largest <= upperPercentLimit){
					allResults.add(new Point(i + 1, j + 1));
					size++;
					//System.out.println(i + " " + j);
				}
			}
		}
		outputTable = new int[size][2];
		Iterator<Point> myIter = allResults.iterator();
		int index = 0;
		while(myIter.hasNext()){
			Point point = myIter.next();
			//System.out.println(key + " " + allResults.get(key));
			outputTable[index][0] = (int) point.getX();
			outputTable[index][1] = (int) point.getY();
			index++;
		}
		return outputTable;
	}