基础代码--排序.docVIP

基础代码--排序 ·快速排序 ·选择排序 ·堆排序 1.快速排序（快速背，快速编，快速排） Procedure qs(l,r:longint); Var i,j,temp,mid:longint; Begin i:=l;j:=r; mid:=a[random(r-l+1)+l];{这里最好用随机数，否则有数据能秒} repeat while a[i]mid do inc(i); while a[j]mid do dec(j); if i=j then begin temp:=a[i]; a[i]:=a[j]; a[j]:=temp; inc(i);dec(j); end; until ij; if ir then qs(i,r); if lj then qs(l,j); End; 2.选择排序 Procedure swap(Var a,b:longint); Var t:longint; Begin t:=a; a:=b; b:=t; End; Procedure Choose_Sort; Begin for i:=1 to n-1 do for j:=i+1 to n do if a[j]a[i] then swap(a[i],a[j]); End; 3堆排序（适用大根堆、小根堆） Program Heap_Sort; Const maxn=1000; Var i,n:longint; a:array[0..maxn]of longint; Procedure swap(Var a,b:longint); Var t:longint; Begin t:=a;a:=b;b:=t; End; Procedure adjust_down(m,r:longint); Var i:longint; Begin while (m=(r div 2)) do begin i:=2*m; if (i+1=r)and(a[i+1]a[i]) then inc(i); if a[i]a[m] then begin swap(a[i],a[m]); m:=i; end else exit; end; End; Begin fillchar(a,sizeof(a),0); readln(n); for i:=1 to n do read(a[i]); for i:=n div 2 downto 1 do adjust_down(i,n); for i:=n downto 2 do begin swap(a[i],a[1]); adjust_down(1,i-1); end; for i:=n downto 1 do write(a[i], ); writeln; End. 希尔排序 Procedure shell(n:integer); var s,j,i,k:integer; begin s:=n; repeat s:=round(s/2); for i:=1 to s do begin j:=i+s; while j=n do begin a[0]:=a[j]; k:=j-s; while (k=i) and (a[k]a[0]) do begin a[k+s]:=a[k]; dec(k,s); end; a[k+s]:=a[0]; inc(j,s); end; end; until s=1; end;