Two years late .. but possibly relevant to the next guy with this question.
I was given the job of generating random part numbers for the current products in inventory. Any new products that would be introduced would also need a part number, and of course these needed to be values not yet used. I chose a pseudo-random number generator algorithm P[n+1] = (P[n] + offset) % S where P is the list of part numbers, S is size of part number space, and offset is the first prime number > S/2. Run S times, P[1..S] will contain every number between 0 and S-1 exactly once, in what appears to be a random order. If you stop the process before reaching S, just remember where you stop and start there when you need the next part number. In this application, it was only necessary that the numbers appear random.
In reply to Re: Check randomly generated numbers have not been used before
by GotToBTru
in thread Check randomly generated numbers have not been used before
by R3search3R
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |