1000 REM SORTING 1001 SCREEN 12:CLS 1010 DIM S(28),N(28) 1022 DIM L$(500),Q$(28) 1030 A$="THIS PROGRAMM IS SHOWING US HOW TO SORT SOME DATA IN SOME ORDER" 1040 B$="WE SHALL SORT LETTERS OF THIS TEXT IN ORDER TO RISE ITS NUMBER IN ASCII CODE" 1050 C$="THEN WE SHALL COUNT NUMBERS OF EACH USING IN THIS TEXT LETTERS" 1060 D$="THE RESULT OF THIS PROGRAMM WILL BE INTRODUSED IN GRAPHIC FORM AS A GISTOGRAMM" 1070 E$="THE HIGH OF CELL SHOWS US USEING FRIQUENCY OF EACH LETTER IN ENGLISH ALPHABET" 1080 W$=A$+B$+C$+D$+E$ 1090 WL=LEN(W$) ?W$ ?"Число букв в данном тексте=";WL ?"Готов посчитать количество разных букв в данном тексте " wata2: if inkey$<>chr$(13) then wata2 cls ?"LETTERS COUNTING":BEEP 1:? 1110 FOR I=1 TO WL 1120 L$(I)=MID$(W$,I,1) 1122 'PRINT L$(I); 1130 NEXT I 1140 FOR I=1 TO 25 1150 S(I)=0:NEXT I:PRINT 1170 FOR I=1 TO WL 1175 IF L$(I)=" " THEN GOTO 1200 1180 N=(ASC(L$(I)))-64 1190 S(N)=(S(N))+1 1200 NEXT I 1210 FOR I=1 TO 26 1220 PRINT CHR$(64+I);"=";S(I), 1230 NEXT I 1240 FOR I=1 TO 26 1250 N(I)=S(I):NEXT I ?:?"Готов сортировать буквы данного текста. Нажмите для продолжения" wata1: if inkey$<>chr$(13) then goto wata1 cls:?"Сортирую.Ждите" sorting: 1312 FOR I=2 TO 25 1320 A=N(I-1):B=N(I) 1330 IF B>A THEN N(I-1)=B:N(I)=A:GOTO sorting 1340 A=N(I):B=N(I+1) 1350 IF B>A THEN N(I)=B:N(I+1)=A:GOTO sorting 1360 NEXT I 1400 FOR I=1 TO 26 1420 FOR J=1 TO 26 1430 S=S(J) 1440 IF S=N(I) THEN S(J)=-1:CD=J+64:GOTO 1456 1450 NEXT J 1455 NEXT I:GOTO 1500 1456 Q$(I)=CHR$(CD) 1460 PRINT Q$(I);"-";N(I), 1470 GOTO 1455 1500 ?:?"Буквы рассортированы. Нажмите для построения распределения" wata4: if inkey$<>chr$(13) then wata4 cls 1510 FOR I=1 TO 26 1520 LOCATE 23,2*I:PRINT Q$(I) H=N(I) 'IF H>21 THEN H=21 FOR Y=22 TO (22-H) STEP -1 pset (16*i-4,170+8*y),10 'LOCATE Y,2*I:PRINT"o" NEXT Y NEXT I locate 1,1:?" - выход" wata5: if inkey$<>chr$(27) then wata5 stop