Ive been wondering about the following problem...
Given a 1D array of n values,
I want to find a 2D array to store it.. But the array has to be as "square as possible",
x_dimension - y_dimension = m
|m| has to be as small as possible.
and without any padding, ie: dummy values filling the array..