10 'Alphabetical sorting:Andrew Dagnall:24/2/1990:Age 12:
20 INK 0,0:INK 1,26:INK 2,2:INK 3,6:PEN 1:PAPER 0:BORDER 26:CLS::'An alternative machine code version is provided for line 90:look at it all you budding machine-coders. It uses à which is the AMSTRAD version of VARPTR. You can change n in 40 30 MODE 1:PRINT"ALPHABETICAL SORT This program is an alphabetical sorter. Before I can sort your words out, you must tell me what they are. You can typein phrases too.":PRINT 40 n=10:PRINT"INPUT YOUR";n;"WORDS":DIM k$(n):FOR i=1 TO n:LINE INPUT k$(i):NEXT:y=1:WHILE y<n:y=2*y:WEND 50 y=INT((y-1)/2):it=n-y:IF y=0 THEN GOTO 100 ELSE PRINT"SORTING CODE #";y;"+";it;"=";n 60 FOR i=1 TO it:j=i 70 z=j+y:IF UPPER$(k$(z))<=UPPER$(k$(j)) THEN GOSUB 90:IF j>0 THEN 70 80 NEXT i:GOTO 50 90 x$=k$(z):k$(z)=k$(j):k$(j)=x$:j=j-y:RETURN::'FOR l=0 TO 2:y1=PEEK(àk$(z)+l):y2=PEEK(àk$(j)+l):POKE (àk$(z)+l),y2:POKE (àk$(j)+l),y1:NEXT:j=j-y:RETURN 100 PRINT"SORTING COMPLETED":PRINT:FOR loop=1 TO n:PRINT k$(loop):NEXT:WHILE INKEY$<>"":WEND:WHILE INKEY$="":WEND |