Список проголосовавших за комментарий "RussianSortingHalvesDAV.bas: рекурсия QB64 Qbasic QuickBasic Basic рекурсия<br/> <br/> ускоряющее развитие:<br/> вместо 2-мерного массива 2 массива d(N) и a(N)<br/> и действительно успешно: сортирует 100ооо за 0,22 секунды<br/> <br/> сортирует 1000ооо за 2,2 секунды<br/> сортирует миллион за 2,2 секунды<br/> sorts 1'000'000 in 2.2 seconds<br/> сортирует 1'000'000 за 2,2 секунды<br/> <br/> ' Russian Sorting Halves Danilin<br/> <br/> DECLARE SUB RussianSortingHalvesDAV (ab!, yz!, part!, age!)<br/> CLOSE<br/> OPEN «c:/N.txt» FOR INPUT AS #5<br/> INPUT #5, n: PRINT n<br/> <br/> 'n=123456<br/> <br/> age=1+LOG(n)/LOG(2)<br/> PRINT n, age<br/> <br/> DIM SHARED d(n) 'AS LONG<br/> DIM SHARED a(n) 'AS LONG<br/> <br/> 'OPEN «c:/ISX.txt» FOR INPUT AS #1<br/> 'FOR i=1 TO n: INPUT #1, d(i): NEXT<br/> <br/> FOR i=1 TO n: d(i)=n-i+1: NEXT ' INT(RND*n)<br/> 'FOR i=1 TO n STEP 2: d(i)=n-i+1: d(i+1)=d(i): NEXT <br/> 'FOR i=1 TO n: d(i)=INT(RND*n): NEXT '<br/> <br/> IF n < 17 THEN FOR k=1 TO n: PRINT d(k);: NEXT: PRINT<br/> IF n > 16 THEN FOR k=n-8 TO n: PRINT d(k);: NEXT: PRINT<br/> <br/> start=TIMER<br/> <br/> IF age > 0 THEN<br/> CALL RussianSortingHalvesDAV(1, n, 1, age)<br/> END IF<br/> <br/> finish=TIMER<br/> <br/> IF n < 17 THEN FOR k=1 TO n: PRINT d(k);: NEXT: PRINT<br/> IF n > 16 THEN FOR k=n-8 TO n: PRINT d(k);: NEXT: PRINT<br/> <br/> PRINT finish-start<br/> <br/> OPEN «c:/=RuSortHalves_dav.txt» FOR OUTPUT AS #2<br/> PRINT #2, finish-start; «sekund „<br/> PRINT #2, n; “elements», «RECURSION»<br/> FOR i=1 TO 22: PRINT #2, d(i): NEXT<br/> FOR i=n-22 TO n: PRINT #2, d(i): NEXT<br/> <br/> FOR k=1 TO 20: PRINT d(k);: NEXT: PRINT: PRINT<br/> FOR k=n-9 TO n: PRINT d(k);: NEXT: PRINT: PRINT<br/> <br/> END<br/> <br/> SUB RussianSortingHalvesDAV (ab, yz, part, age)<br/> <br/> IF yz-ab < 1 THEN EXIT SUB<br/> <br/> FOR i=ab TO yz<br/> summa=summa+d(i)<br/> NEXT<br/> middle=summa/(yz-ab+1)<br/> <br/> abc=ab-1<br/> xyz=yz+1<br/> <br/> FOR i=ab TO yz<br/> IF d(i) < middle THEN abc=abc+1: a(abc)=d(i): ELSE xyz=xyz-1: a(xyz)=d(i)<br/> NEXT<br/> <br/> FOR i=ab TO yz: d(i)=a(i): NEXT<br/> <br/> IF part < age THEN<br/> IF abc >= ab THEN CALL RussianSortingHalvesDAV(ab, abc, part+1, age)<br/> IF xyz <= yz THEN CALL RussianSortingHalvesDAV(xyz, yz, part+1, age)<br/> END IF<br/> <br/> END SUB"