Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
kardos
on April 4, 2016
|
parent
|
context
|
favorite
| on:
Vitter's reservoir sampling algorithm D: randomly ...
You're making the assumption that the requested list is quite short. It should be straightforward to show that the probability of a duplicate grows with the requested list length.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: