learn.howToCalculate
learn.whatIsHeading
A random name picker selects one or more names at random from a list — useful for prize draws, assigning tasks, picking teams, or choosing a winner fairly.
Wzór
Random selection algorithm: each name probability = 1/n (uniform); weighted if importance varies
- n
- Number of names in list
- P
- Probability of selection (1/n)
Przewodnik krok po kroku
- 1Uniform random selection: each name has equal probability
- 2Without replacement: once picked, removed from pool
- 3With replacement: same name can be picked again
- 4Fisher-Yates shuffle ensures unbiased randomness
Rozwiązane przykłady
Wejście
Pick 1 winner from 50 names
Wynik
Each name has exactly 1/50 = 2% chance of being selected
Często zadawane pytania
How is random name selection done fairly?
Each name gets equal probability (1/n) using pseudo-random number generator. True randomness is algorithmic.
Can weighted selection be used?
Yes. If some names are more likely, adjust probabilities. Raffle: ticket quantity = probability weight.
Is a name picker better than drawing names?
Both fair if unbiased. Digital: audit trail, repeatable. Physical draw: perceived fairness, transparent process.