Find a line such that on each side of the line, there are at most floor (N / 2) red points, and at most floor (M / 2) blue points.
It's easy to prove that this is impossible if either M or N has an odd number of elements. You must have meant ceil(). (Of course, that still wouldn't address the problem with infinite sets...)
-sauoq "My two cents aren't worth a dime.";
In reply to Re: Re: Suggestions for writing a Perl application
by sauoq
in thread Suggestions for writing a Perl application
by phax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |