Quicksort basic yardımcı olursanız seviirim.

[trouble38]

arkdaşlar aşağıdaki qick sort için verilmiş kodu anlatabilirmisiniz.ilgilendiğiniz için şimdiden tşk ederim.

REM quicksort(non-recursive)
CLS
INPUT "how many numbers to sort"; n
DIM a(n), r(n), s(n, 2)
RANDOMIZE TIMER
FOR i = 1 TO n: a(i) = INT(n * RND) + 1: NEXT i
GOTO 20
10 GOTO 160
20 st = TIMER
z = 1
s(z, 1) = 1
s(z, 2) = n
30 IF s(z, 1) = 0 THEN GOTO 10
l1 = s(z, 1)
r1 = s(z, 2)
s(z, 1) = 0: s(z, 2) = 0
z = z - 1
40 GOSUB 70
IF l2 = 0 AND l3 = 0 THEN GOTO 30
IF l2 <> 0 AND l3 = 0 THEN GOTO 60
IF l2 = 0 AND l3 <> 0 THEN GOTO 50
z = z + 1
s(z, 1) = l2
s(z, 2) = r2
50 l1 = l3
r1 = r3
GOTO 40
60 l1 = l2
r1 = r2
GOTO 40
70 x = a(l1)'subroutine begins from here'
r = r1
i = l1
80 FOR j = r TO l1 STEP -1
IF i = j THEN GOTO 110
IF x > a(j) THEN GOTO 90
NEXT j
90 a(i) = a(j)
l = i + 1
FOR i = l TO r1
IF i = j THEN GOTO 110
IF x < a(i) THEN GOTO 100
NEXT i
100 a(j) = a(i)
r = j - 1
GOTO 80
110 a(i) = x
IF i <= l1 + 1 THEN GOTO 120
l2 = l1
r2 = i - 1
GOTO 130
120 l2 = 0
r2 = 0
130 IF j >= r1 - 1 THEN GOTO 140
l3 = j + 1
r3 = r1
GOTO 150
140 l3 = 0
r3 = 0
150 RETURN
160 et = TIMER
PRINT "run time in sec="; et - st
END