The length of the random part will decide about the probability to detect such a problem.
Whilst you're right about the probability, the question still arises, do you try to detect the problem?
Ie. Would you be happy with a sort utility that had the possibility to produce wrong results occasionally?
If so, what probability would you accept?
In reply to Re^2: Generate a unique ID
by BrowserUk
in thread Generate a unique ID
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |