home *** CD-ROM | disk | FTP | other *** search
- 10 PRINT "ALPHABETIZE"
- 20 ?
- 30 PRINT "(TO END PROGRAM ENTER 0)"
- 40 PRINT "NUMBER OF ITEMS";
- 50 INPUT Y
- 59 ! END PROGRAM?
- 69 ! LIMIT ARRAY TO MAXIMUM NUMBER OF ITEMS TO BE ENTERED IN ONE RUN
- 70 DIM A$(25)
- 80 FOR I=1 TO Y
- 90 PRINT "ITEM" I;
- 100 INPUT A$(I)
- 110 NEXT I
- 119 ! LOOP TO ALPHABETIZE DATA
- 1010 M=Y
- 1017 ! THE SORT TECHNIQUE USED IN LINES 1000-1180 COMPARES DATA ITEMS
- 1018 ! IN DIMINISHING INCREMENTS. THE FIRST PASS COMPARES ITEMS N/2
- 1019 ! ELEMENTS APART, AND SO ON UNTIL THE INCREMENT IS EXAUSTED.
- 1020 M=INT(M/2)
- 1030 IF M=0 THEN 1190
- 1040 K=Y-M
- 1050 J=1
- 1060 I=J
- 1070 L=I+M
- 1090 IF A$(I)<=A$(L) THEN 1160
- 1100 N=N+1
- 1110 T$=A$(I)
- 1120 A$(I)=A$(L)
- 1130 A$(L)=T$
- 1140 I=I-M
- 1150 IF I>=1 THEN 1070
- 1160 J=J+1
- 1170 IF J>K THEN 1020
- 1180 GOTO 1060
- 1190 FOR I=1 TO Y
- 1200 PRINT A$(I)
- 1210 NEXT I
- 1220 GOTO 40
- 1300 END
-