Re: Probabilistic Data Structure

From: Amey Samant (ameyas7_at_yahoo.com)
Date: 10/01/03 

Date: 30 Sep 2003 20:23:07 -0700

SteveE <eaborn@btinternet.com_> wrote in message news:<Ai%db.3986$oH1.33858631@news-text.cableinet.net>...
> OK, it does rely on the random number generator producing an even spread.
>
> If you need guarantee an even distribution then what about shuffling the
> 100 elements randomly and selecting incrementally, repeating the shuffle
> every 100 elements?
>
> SteveE

hi StevE
see you agreed that random number generation would cause problem in
first case then again in your answer you are talking about shuffling
elements RANDOMLY :d how would you solve the second RANDOM case then
;)
neways
another issues with this could be COST
if there are 1000 elements , shuffling 1000 elements for every element
would make your program much slower as the complexity increases
TREMENDOUSLY with this logic

regards
amey

Relevant Pages

  • Re: Probabilistic Data Structure
    ... This method will guarantee an even distribution over the ... shuffling data around is what computers are ...
    (comp.lang.java)
  • Checking fairness of a shuffling algorithm numerically
    ... Suppose you have a shuffling algorithm on n cards. ... test whether k shuffles randomizes the deck sufficiently. ... distribution and actual distribution is less than epsilon. ...
    (sci.math)
  • Re: Probabilistic Data Structure
    ... > first case then again in your answer you are talking about shuffling ... This method will guarantee an even distribution over the ... but you would pay a time cost when ...
    (comp.lang.java)