Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^2: Retrieving data with largest count

by Angharad (Pilgrim)
on Jun 02, 2009 at 15:15 UTC ( #767630=note: print w/replies, xml ) Need Help??


in reply to Re: Retrieving data with largest count
in thread Retrieving data with largest count

Many thanks for the advice so far. Much appreciated. In answer to your question, if two items have the same count, choosing an item at random is fine.
  • Comment on Re^2: Retrieving data with largest count

Replies are listed 'Best First'.
Re^3: Retrieving data with largest count
by GrandFather (Saint) on Jun 04, 2009 at 20:27 UTC
    "choosing an item at random is fine"

    and also the hardest option. All candidates in a group have to be retained until processing the input data is complete, then all groups have to be checked for multiple candidate items and a random item selected.

    If either 'first' or 'last' is also fine then either of those is easier to implement.


    True laziness is hard work

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://767630]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (6)
As of 2023-02-01 14:58 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I prefer not to run the latest version of Perl because:







    Results (10 votes). Check out past polls.

    Notices?