pascal排序算法分析.pptVIP

42 220 41 185 242 190 225 231 i=1 j=7 42 220 41 185 242 190 225 231 i=2 j=6 42 220 41 185 242 190 225 231 i=2 j=5 42 220 41 185 242 190 225 231 i=2 j=4 42 185 41 220 242 190 225 231 i=2 j=4 42 185 41 220 242 190 225 231 i=3 j=3 42 185 41 220 242 190 225 231 i=4 j=3 42 185 41 220 242 190 225 231 i=4 j=3 L..j i..R const maxn=100000; fin=sort.in; fout=sort.out; var a:array[1..maxn] of longint; n:longint; procedure init; var i:longint; begin assign(input,’f.in’); reset(input); readln(n); for i:=1 to n do read(a[i]); close(input); end; procedure qsort(head,tail:longint); var i,j,mid,tem:longint; begin i:=head; j:=tail; mid:=a[(head+tail)div2]; while i=j do begin while a[i]mid do inc(i); while a[j]mid do dec(j); if i=j then begin tem:=a[i]; a[i]:=a[j]; a[j]:=tem; inc(i); dec(j); end; end; if headj then qsort(head,j); if itail then qsort(i,tail); end; procedure print; var i:longint; begin assign(output,fout); rewrite(output); for i:=1 to n-1 do write(a[i], ); writeln(a[n]); close(output); end; begin init; qsort(1,n); print; end. 随机快排 program qsortsortpro; const max=10000; var n,i:longint; a:array[1..max]of longint; procedure qsort(head,tail:longint); var i,j,x,t:longint; begin i:=head; j:=tail; x:=a[random(tail-head+1)+head]; //随机选取参考值 head—tail while ij do begin while a[i]x do inc(i); while xa[j] do dec(j); if (i=j) then begin t:=a[i]; a[i]:=a[j]; a[j]:=t; inc(i); dec(j); end; end; if headj then qsort(head,j); if itail then qsort(i,tail); end; begin readln(n); randomize; for i:=1 to n do read(a[i]); qsort(1,n); for i:=1 to n do writeln(a[i]); end. 取首快排 program quicksort; const mx=10000; var n,i:longint; d:array[1..mx]of longint; procedure qsort(he