> Compute the hash as the xor of the hash of the items. That way you
> don't need to sort first, and you'll get an O(n) hash instead of
Can you give an example?
Does this gives uniq keys?
(BTW: n < 20 always)