Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: Re: Re: Bingo Challenge

by Matts (Deacon)
on May 20, 2002 at 06:47 UTC ( #167778=note: print w/ replies, xml ) Need Help??


in reply to Re: Re: Bingo Challenge
in thread Bingo Challenge

Have you benchmarked that to see if it's faster?

My suspicion would be that for large data sets it would be, but for smaller ones my naive rand() implementation would be quickest.


Comment on Re: Re: Re: Bingo Challenge
Re: Bingo Challenge
by CharlesClarkson (Curate) on May 20, 2002 at 11:16 UTC
    Have you benchmarked that to see if it's faster?

    No, I used logic. (which is why I said it could be faster.) A shuffling algorithm takes the same time to shuffle on each pass. It's really just randomizing the array indexes. The idiom you were using varies each time through. The less words left, the longer it will take to produce an unchosen word. My thought was, perhaps you were unaware of shuffling or its application here.


    HTH,
    Charles K. Clarkson
    Clarkson Energy Homes, Inc.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (7)
As of 2014-07-28 22:53 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (210 votes), past polls