Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re^3: Retrieving data with largest count

by GrandFather (Saint)
on Jun 04, 2009 at 20:27 UTC ( [id://768579]=note: print w/replies, xml ) Need Help??


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

"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
  • Comment on Re^3: Retrieving data with largest count

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others musing on the Monastery: (2)
As of 2024-04-26 06:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found