public static void printPokerCombInOrder(int minRank, int maxRank) {
		int hand[] = new int[5];
		
		int answerHand[][] = new int[2598960][5];
		
		double maxValue = maxRank * Math.pow(13, 5);
		double minValue = minRank * Math.pow(13, 5);
		
		System.out.println("max Value: " + minValue);
		System.out.println("min Value: " + minValue);
		boolean array[] = new boolean[52];
		
		for(int i=0; i<5; i++) {
			array[i] = true;
		}
		
		int stength;
		
		int numAnswers = 0;
		while(array != null) {
			
			hand = getHand(array);
			
			stength = getHandStrength(hand);
			if(stength >= minValue && stength <= maxValue) {
				answerHand[numAnswers] = hand;
				numAnswers++;
			}
			
			array = PokerUtilityFunctions.getNextCombination(array);
		}
		
		System.out.println("Number of answer: " + numAnswers);
		
		//TODO: faster sort function than O(n^2) please?
		//TODO 2: only calc hand strength once.
		System.out.println("Sort the answers:");
		for(int i=0; i<numAnswers; i++) {
			for(int j=i; j<numAnswers; j++) {
				if(getHandStrength(answerHand[i]) > getHandStrength(answerHand[j])) {
					swap(i, j, answerHand);
				}
			}
		}
		System.out.println("print answers from weakest to strongest:");
		for(int i=0; i<numAnswers; i++) {
			for(int j=0; j<5; j++) {
				System.out.print(DeckFunctions.getCardString(answerHand[i][j]) + " ");
			}
			System.out.println();
		}
	}