Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re^6: best sort

by jpl (Monk)
on Aug 16, 2011 at 18:36 UTC ( #920541=note: print w/replies, xml ) Need Help??

in reply to Re^5: best sort
in thread best sort

It helps a lot with the how I am comparing part, although if anyone guessed in advance that was how By vowels: sorted, I'd like to solicit their advice on the outcome of upcoming NFL games. It's still not exactly what I had in mind for bringing all identical terms together. The
$a->{RECNO} <=> $b->{RECNO}
is unnecessary if the sort is stable, as sort() is, by default. Since different words can compare equal under the influence of
$a->{DICTFOLD} cmp $b->{DICTFOLD}
(if I'm correctly guessing what DICTFOLD is), I still might see
word Word word Word
in the sorted output, when I might have preferred
word word Word Word
which makes it easier to determine if words are "unique" without repeating all the complicated logic. So I would prefer
$a->{ORIGINAL} cmp $b->{ORIGINAL}
as the final tie-breaker. That's neither better nor worse than your code, merely different.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://920541]
[mandarin]: LanX aren't you a bit late to the party?

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (10)
As of 2018-06-18 17:47 GMT
Find Nodes?
    Voting Booth?
    Should cpanminus be part of the standard Perl release?

    Results (110 votes). Check out past polls.