getRectArrangements returns poor results for some square numbers

[kylemcdonald]

import rasterfairy
for side in range(4, 100):
    n = side*side
    best = rasterfairy.getRectArrangements(n)[0]
    if side != best[0]:
        print(side, best)

i would expect this to print nothing, because getRectArrangements should quickly find that there is a square available. instead, it prints:

not enough memory for amount of possible permutations, creating grouped set
not enough memory for amount of possible permutations, creating grouped set
48 (36, 64)
not enough memory for amount of possible permutations, creating grouped set
not enough memory for amount of possible permutations, creating grouped set
72 (64, 81)
not enough memory for amount of possible permutations, creating grouped set
80 (64, 100)
not enough memory for amount of possible permutations, creating grouped set
96 (72, 128)

this makes me skeptical that it's generally finding the best solution.

here is an alternative implementation that i use, it finds the rectangle that is closest to a square:

import math
def find_rectangle(n): 
    max_side = int(math.sqrt(n))
    for h in range(2, max_side+1)[::-1]:
        w = n // h
        if (h * w) == n:
            return (h, w)
    return (n, 1)