\u041a\u0430\u043a \u0441\u043e\u0440\u0442\u0438\u0440\u043e\u0432\u0430\u0442\u044c \u043c\u0430\u0441\u0441\u0438\u0432 \u0441\u043e\u0440\u0442\u0438\u0440\u043e\u0432\u043a\u043e\u0439 \u0441\u043b\u0438\u044f\u043d\u0438\u044f\u043c\u0438?
\n<\/p>\n
const n=10;\nvar a,c:array[1..n] of integer;\n t:integer;\n\n...\n\nProcedure Sliv(a1,k,b:integer); {\u0432\u0441\u043f\u043e\u043c\u043e\u0433\u0430\u0442\u0435\u043b\u044c\u043d\u0430\u044f \u043f\u0440\u043e\u0446\u0435\u0434\u0443\u0440\u0430}\nvar i,j,w:integer;\nbegin\n w:=0; i:=a1; j:=k+1;\n while (i<=k) and (j<=b) do\n if (a[j]>a[i]) then begin inc(w); c[w]:=A[i]; inc(i); end else\n begin inc(w); c[w]:=A[j]; inc(j); end;\n for i:=i to k do begin inc(w); c[w]:=A[i]; end;\n for j:=j to b do begin inc(w); c[w]:=A[j]; end;\n w:=0;\n for i:=a1 to b do begin inc(w); A[i]:=c[w]; end;\nend;\n\nProcedure Sort_Sliv(b,e:integer); {sort sliv}\nvar l:integer;\nbegin\nif (e-b>1) then\nbegin\n l:=(b+e) div 2;\n if (l-b>0) then Sort_Sliv(b,l);\n if (e-l>0) then Sort_Sliv(l+1,e);\n Sliv(b,l,e);\nend else\nif (e-b=1) then if A[b]>A[e] then begin t:=A[b]; A[b]:=A[e]; A[e]:=t; end;\nend;\n\n\u0412\u044b\u0437\u043e\u0432:\nSort_Sliv(1,n);\n<\/div><\/pre>\n