This code produces a “random” sequence of integers between specified Lower and Upper values without duplication. On the first call to the Shuffle routine with new values for Upper and Lower, Shuffle performs an efficient prime factorization, computes the constants for a linear sequence generator, and uses Randomize to generate a seed value. Each subsequent call with the same value of Upper and Lower uses this generator to return the next “random” number in the sequence. The sequence does not repeat until all possible values have been returned. This code fills the array with 20 random numbers between 1 and 100, without duplication:

 For I = 1 To 20	num(I)=Shuffle(1,100)next I

Here is the Shuffle routine:

 Static Function Shuffle (Lower As Integer, _	Upper As Integer) As IntegerStatic PrimeFactor(10) As Integer  Static a As Integer, c As Integer, b As IntegerStatic s As Integer, n As IntegerDim i As Integer, j As Integer, k As IntegerDim m As IntegerIf (n <> Upper - Lower + 1) Then	n = Upper - Lower + 1	i = 0	n1 = n	k = 2	Do While k <= n1		If (n1 Mod k = 0) Then			If (i = 0 Or PrimeFactor(i) <> k) Then				i = i + 1				PrimeFactor(i) = k 			End If			n1 = n1 / k		Else			k = k + 1		End If	Loop	b = 1	For j = 1 To I		b = b * PrimeFactor(j)	Next j	If n Mod 4 = 0 Then b = b * 2	a = b + 1	c = Int(n * .66)	t = True	Do While t		t = False		For j = 1 To I			If ((c Mod PrimeFactor(j) = 0) Or _				(c Mod a = 0)) Then t = True		Next j		If t Then c = c - 1	Loop	Randomize	s = Rnd(n)End Ifs = (a * s + c) Mod nShuffle = s + LowerEnd Function