You have it backwards. The smaller the set and the longer the string, the higher the chance of producing something that needs to be thrown away. What you call the non-extreme case is where your algorithm has the most problems.
The real problem is that your solution isn't random. The chance of picking a characters at a certain position is affected by the characters picked in previous positions.
In reply to Re^2: Random data generation.
by ikegami
in thread Random data generation.
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |