On Fri, 27 Jan 2012 16:45:41 -0600, Andrei Alexandrescu
<[email protected]> wrote:
On 1/27/12 5:35 PM, Christof Schardt wrote:
The brute force approach would essentially compute the two ranks and
then sort by their sum. That's three sorts and at least one temporary
I think, you are mixing two problem levels:
Level one (theory):
How are the two properties weighted against each other
and can be combined to a total weight (a weight-function).
There's no weighing. The sorting order is rank(k1) + rank(k2).
Weighting doesn't imply a simple linear constant. The rank function is an
example of a non-linear weighting scheme. Non-linear weighting functions are
common in complex sorting and classification problems.
