| Shuffle Sort algorithm - unique random numbers with no duplicatesMarch 23 2008 at 1:10 AM | Solitaire from IP address 24.90.213.75 | |
| DIM x AS INTEGER, y AS INTEGER, z AS INTEGER, E AS STRING
DIM mix AS INTEGER, temp AS INTEGER
DIM MyNum(20) AS INTEGER
CLS : PRINT "Random array of 20 number values without repeats"
PRINT "Enter to list numbers in a different order or Q to quit"
FOR x = 1 TO 20 'assign sequential value to array elements
MyNum(x) = x
NEXT x
RANDOMIZE TIMER
DO
FOR y = 1 TO 20 'swap array positions randomly
mix = INT(RND * 20) + 1
temp = MyNum(mix)
MyNum(mix) = MyNum(y)
MyNum(y) = temp
NEXT y
PRINT : PRINT
FOR z = 1 TO 20 'print array value in new order
PRINT MyNum(z);
NEXT z
E$ = INPUT$(1)
LOOP UNTIL UCASE$(E$) = "Q"
SYSTEM
|
| | Responses |
|
|