Rapid sort
The Rapid sort or Instant sort (name of hardware version) is a sorting algorithm in which data is used to address the contents of an indexed array and the contents then incremented. The counts are then read from each location in sequential order by incrementing the index and printing the index the same number of times as the content values. Sorting is therefore transparent, automatic and instantaneous.
DIM a(9999999)
'--- Beginning of first "pass" ---------
FOR I=1 TO 100
n=INT(4*RND)
a(n)=a(n)+1
NEXT I
'--- Beginning of second "pass" --------
FOR I=0 TO 9999999
DO
if a(I)>0 then PRINT I
a(I)=a(I)-1
LOOP UNTIL a(I)=0
NEXT I
END
DIM a(9999999)
'--- Beginning of first "pass" ---------
FOR I=1 TO 100
n=INT(4*RND)
a(n)=a(n)+1
NEXT I
'--- Beginning of second "pass" --------
FOR I=0 TO 9999999
DO
if a(I)>0 then PRINT I
a(I)=a(I)-1
LOOP UNTIL a(I)=0
NEXT I
END
Rapid sort by Patrick Eberhart June 11, 2006
Get the Rapid sort mug.