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

Re^3: Finding a random position within a long string (Activeperl Build 822)

by snopal (Pilgrim)
on Oct 13, 2007 at 14:03 UTC ( #644632=note: print w/replies, xml ) Need Help??


in reply to Re^2: Finding a random position within a long string (Activeperl Build 822)
in thread Finding a random position within a long string (Activeperl Build 822)

By your statement, there is no distribution restriction "if the number of samples taken is large enough." By placing all 10% of your '?' at the beginning and doing a tremendous number of samples, your "data full of ?" or "data of no ?" should even out to 10%. You just have to take a large number of samples.

Since neither the sample size, nor the number of samples is defined, it could just as easily be "one sample of ten percent plus one", the result of which would be that virtually every random solution would fail.

This looks like homework. The level of sophistication of your request changed dramatically from the original problem statement to the response you gave me.

  • Comment on Re^3: Finding a random position within a long string (Activeperl Build 822)

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others cooling their heels in the Monastery: (8)
As of 2020-10-30 13:05 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My favourite web site is:












    Results (279 votes). Check out past polls.

    Notices?