A calculator for calculating "outs" which is the maximum number of idenitical rectangles that fit inside a larger rectangle. Uses a greedy heristic solver based on B-trees to solve this rectangle packing problem. This program also shows the best fit layout and the efficency of packing relative to the maximum area tileable.