Read what Secrets wrote again. It sounded like a confirmation to me.
Assuming a uniform distribution of random numbers over time, I would assume the next to last person on the list will be picked twice as often as anyone else, and the last person will never be picked.
It's also not very efficient code. No need to walk the list when there's a Count() function that returns the number of elements in the list.
|