Can you come up with a sort() comparison function which:
1. Is horrendously complex.
2. Cannot be improved using or-cache or Schwartzian Transform.
3. (Implied by 2) Cannot be rewritten as:
sub { (...$a...) cmp (...$b...) } or equivalent with <=>
4. Is consistent. (a < b and b < c implies a < c)
5. Has at least a slight chance of being actually useful. (optional)
There's no particular reason for this challenge; I just think it's
interesting and difficult.
--
Kevin Reid: | Macintosh:
"I'm me." | Think different.
