ф ╡MА SA(5000),ST(30,1)B╡MNI = 5000:К CHANGE DIM 500 AND THIS 500 IF ARRAY SORT LARGER╗MА X = 0 К NI:(┴M SA(X)=Ж(1000):К STORES RANDOM NUMBERS FOR SORTING2╥MА<▀MА1 "START TIME: ";ИFёMА "QUICK SORT"PЇMА1 "FINISH TIME: ";ИZNА X=NI-10 К NIBdN А1 SA(X):К PRINT LAST 10 ELEMENTS TO MAKE SURE SORT WORKEDnNАx,NАВ/N"QUICK SORT"BМ/NК Improved Quicksort submitted by Johan Brouwer, Luxembourg.(Ц/NК Thanks for the submission, Johanа/NSP = 0 : ST(0,0) = 0кFNST(0,1) = NI┤VNА30╛VN L = ST(SP,0) : R = ST(SP,1) : SP = SP - 1 ╚|N А3+╥|N LI = L : RI = R : SA = SA((L+R)/2)▄бN А3цбN А8 SA(LI) < SAЁдN LI = LI + 1 ·иN А9╕N А8 SA(RI) > SA╗N RI = RI - 1 ┐N А9"╧N А А LI <= RI,█N А SA(LI), SA(RI)&6ЁN LI = LI + 1 : RI = RI - 1@°N А АJ°N А4 LI > RI TO А А (R-LI) > (RI - L)^O А А L < RI7h$O SP = SP + 1 : ST(SP,0) = L : ST(SP,1) = RIrJO А А|JO L = LIЖPO АРSO А А LI < R7Ъ_O SP = SP + 1 : ST(SP,0) = LI : ST(SP,1) = RдЕO А АоЕO R = RI╕ЛO А А┬ЛO А4 R <= L╠ЧOА4 SP = -1$╓вOА : К Quicksort finished hereргOА