@teams = sort {$b->{WinPct} <=> $a->{WinPct}  ||
               ($a->{Conference} eq $b->{Conference}
                ?($b->{ConfWinPct} <=> $a->{ConfWinPct} ||
                  $b->{ConfWon}    <=> $a->{ConfWon}   ||
                  $a->{ConfLost}   <=> $b->{ConfLost})
                :($a->{Division} eq $b->{Division}
                  ?($b->{DivWinPct} <=> $a->{DivWinPct} ||
                    $b->{DivWon}    <=> $a->{DivWon}   ||
                    $a->{DivLost}   <=> $b->{DivLost})
                  :0
                  )
                ) ||
               $b->{Won}         <=> $a->{Won}  ||
               $a->{Lost}        <=> $b->{Lost} ||
               $b->{GamesPlayed} <=> $a->{GamesPlayed}
              } @teams;

Creating a keycode for this situation is not a trivial task at all. So
sorts do occur in the real world for which there is no straightforward
way to generate a sortkey. Albeit considerably rare.

Also, I think there is utility in have a compare sub supported so that:
1) porting P5 code is easier. (a minor design rationale, but it exists)
2) people used to thinking in terms of compare subs (from C, P5, and
points of the programming universe) can still think that way.
3) most importantly to me, so that There's More Than One Way to Do It.

-- Rod Adams