Реализация алгоритма "Быстрая сортировка" на Quick Basic

CLS
RANDOMIZE TIMER
 
INPUT "Vvedite razmer massiva: ", n
 
DIM SHARED y(n)
 
PRINT "Ishodnij massiv:"
FOR I = 1 TO n
 y(I) = INT(RND * 100) + 1
 PRINT y(I);
NEXT I
PRINT
 
QSORT 1, n
 
PRINT "Otsortirovannij massiv:"
FOR I = 1 TO n
 PRINT y(I);
NEXT I
 
SUB QSORT (LOW, HIGH)
   J = HIGH
   X = y((LOW + HIGH) / 2)
   DO
      WHILE y(I) < X: I = I + 1: WEND
      WHILE y(J) > X: J = J - 1: WEND
      IF I <= J THEN
         SWAP y(I), y(J)
         I = I + 1
         J = J - 1
      END IF
   LOOP WHILE I <= J
   IF LOW < J THEN QSORT LOW, J
   IF I < HIGH THEN QSORT I, HIGH
END SUB

OPTION BASE 1
RANDOMIZE TIMER
DIM n AS INTEGER
DIM i, j AS INTEGER
DIM x, p AS INTEGER
DIM si, fi, sj, fj AS INTEGER
CLS
x = 2      'delitel
n = 7   'dlina massiva
j = n
i = 1
 
DIM arr(n) AS INTEGER
 
FOR k% = 1 TO n
 arr(k%) = INT(RND * 9) + 1
 PRINT arr(k%);
NEXT k%
PRINT
 
'poisk srednego indeksa
avr% = (n / x) + 1
memo% = avr%
'opornij element
p = arr(avr%)
si = 1  'l means start for i
fi = n  'h means finish fo i
 
sj = 1   'start for j
fj = n   'finish for j
'-------------------------------------------------
PRINT
start:
DO
FOR i = si TO fi
   IF arr(i) >= p THEN si = si + 1: EXIT FOR
NEXT i
 
FOR j = fj TO sj STEP -1
'  PRINT arr(j);
  IF arr(j) <= p THEN fj = fj - 1: EXIT FOR
NEXT j
 
IF i <= j THEN SWAP arr(i), arr(j)
 
LOOP WHILE i <= j
'-------------------
'2 etap
IF flg% = 0 THEN
 si = 1: fi = avr% 'indeks v kotorom nahoditsa opornij element !!!
 sj = 1: fj = avr%
 
 avr% = avr% / 2
 IF avr% = 1 THEN avr% = memo% + 1: flg% = 1
END IF
 
IF flg% = 1 THEN
 avr% = avr% + c%: c% = c% + 1: IF avr% > n THEN GOTO 15
END IF
 
p = arr(avr%)
GOTO start
15
FOR k% = 1 TO n
 PRINT arr(k%);
NEXT k%

'm - indeks opornogo elementa
CLS
RANDOMIZE TIMER
DIM n, m, x AS SINGLE
DIM low, high AS SINGLE
DIM flg AS INTEGER
 
n = 7   'dlina massiva
DIM y(n) AS SINGLE
 
'y(1) = 3: y(2) = 2: y(3) = 7: y(4) = 1: y(5) = 8: y(6) = 1: y(7) = 7
PRINT "Ishodnij massiv:"
FOR k% = 1 TO n
 y(k%) = INT(RND * 9) + 1
 PRINT y(k%);
NEXT k%
low = 1
high = n
 
start:
j = high
m = (low + high) / 2
 
IF flg2% = 0 THEN
 memo1% = m + 1
 memo2% = n: flg2% = 1
END IF
x = y(m)
 
DO
 WHILE y(i) < x: i = i + 1: WEND
 WHILE y(j) > x: j = j - 1: WEND
  IF i <= j THEN
   SWAP y(i), y(j)
   i = i + 1
   j = j - 1
  END IF
LOOP WHILE i <= j
IF flg = 0 THEN
  IF low < j THEN low = 1: high = j: i = 0: GOTO start
  IF i = high THEN low = i + 1: high = n: i = 0: GOTO start'new
END IF
 
IF j = 1 AND i = 3 THEN
 flg = 1
 low = memo1%
 high = memo2%
 i = 0
 GOTO start
END IF
'pravij perebor
IF low < j THEN
 low = memo1%
 high = high - 1
 i = 0
 GOTO start
END IF
'if i = high 'new
'------
PRINT
PRINT "Otsortirovanij massiv:"
FOR k% = 1 TO n
 PRINT y(k%);
NEXT k%

DECLARE SUB SORT (LOW!, high!)
CLS
RANDOMIZE TIMER
 
INPUT "Vvedite razmer massiva: ", razmer
 
DIM SHARED y(razmer)
 
PRINT "Ishodnij massiv:"
FOR i = 1 TO razmer
 y(i) = INT(RND * 100) + 1
 PRINT y(i);
NEXT i
PRINT
 
i = 1
DO
    FOR j = 1 TO i
        SORT razmer / i * (j - 1), razmer / i * j
    NEXT j
    IF i > razmer THEN EXIT DO
    i = i * 2
LOOP
 
PRINT "Otsortirovannij massiv:"
FOR i = 1 TO razmer
 PRINT y(i);
NEXT i
 
SUB SORT (LOW, high)
    sr = INT((LOW + high) / 2)
    DO
        imax = LOW
        FOR i = LOW TO sr
            IF y(i) > y(imax) THEN imax = i
        NEXT i
        
        jmin = sr + 1
        FOR j = sr + 1 TO high
            IF y(j) < y(jmin) THEN jmin = j
        NEXT j
        
        IF y(imax) > y(jmin) THEN SWAP y(imax), y(jmin) ELSE EXIT DO
    LOOP
END SUB

SORT INT(razmer / i * (j - 1)), INT(razmer / i * j)