On Mon, Aug 17, 2009 at 3:23 PM, John Randall<[email protected]> wrote: > Raul, could you give some more examples of expected results?
I would but you solved it better than I described it. > My approach is to sort the differences for each combination, pick the > lexicographically greatest, and use this to select combinations. Will > this do the trick, or am I misunderstanding the problem? This is exactly what I was looking for. And, yes, my stated spec left some ambiguities which would have allowed other solutions. (And I had been chasing those other solutions, which was part of why I needed help.) (R.E. Boss's approach also seems to be relevant, but I need to study his some more.) Thanks, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
