Algo-random Problem

Hello list.

I have a randomization problem, and maybe someone can offer some help? So here is the thing:

- When a new number arrives (counter of incoming entries), the randomization process begins.
- The urn will randomize from minimum to maximum.
- When the urn cycle is reached, a function checks to see if there is a new incoming number. If no, then the process stops, if yes, then the urn minimum becomes the maximum, and the maximum becomes the new incoming counter entry, and the process continues with new random values from the new minimum to the new maximum.

Apparently I'm stuck, anyone has a more clear mind over this?

Thanks!