Rule table
Move to second attempt.
Empty dp2d method.
Beginning the experiment.
Proper table and tree prints.
Step 1
bsearch_i
Compute first border
Cleanup.
Quality functions.
Proper float comparison.
Use min threshold
Qsort int reverse.
Select triangles such that there are always items in them.
Resolve warning.
Function for next triangle.
Mine
Print item table
Items inside a triangle
Double cmp.