常用算法 By Fluorine.docVIP

常用算法整理 By Fluorine 排序算法 Insertion-sort function search(a:arr;head,tail,key:integer):integer; var mid:integer; begin if head=tail then exit(head) else begin mid:=(head+tail) div 2; if keya[mid] then exit(search(a,head,mid,key)) else exit(search(a,mid+1,tail,key)); end; end; procedure insertionsort(var a:arr;n:integer); var i,j,k,key:integer; begin for i:=2 to n do begin key:=a[i]; j:=search(a,1,i,key); for k:=i downto j+1 do a[k]:=a[k-1]; a[j]:=key; end; end; Merge-sort procedure merge(var a:arr;head,mid,tail:integer); var b:arr; i,j,k:integer; begin for i:=head to tail do b[i]:=a[i]; i:=head; j:=mid+1; k:=head; while (i=mid)and(j=tail) do begin if b[i]b[j] then begin a[k]:=b[i]; inc(i); end else begin a[k]:=b[j]; inc(j); end; inc(k); end; while i=mid do begin a[k]:=b[i]; inc(i); inc(k); end; while j=tail do begin a[k]:=b[j]; inc(j); inc(k); end; end; procedure mergesort(var a:arr;head,tail:integer); var mid:integer; begin if headtail then begin mid:=(head+tail) div 2; mergesort(a,head,mid); mergesort(a,mid+1,tail); merge(a,head,mid,tail); end; end; Quick-sort procedure quicksort(var a:arr;head,tail:integer); var x,i,j:integer; begin x:=a[head]; i:=head; j:=tail; while ij do begin while (ij)and(a[j]x) do dec(j); if ij then begin a[i]:=a[j]; inc(i); end; while (ij)and(a[i]x) do inc(i); if ij then begin a[j]:=a[i]; dec(j); end; end; a[i]:=x; if headi-1 then quicksort(a,head,i-1); if j+1tail then quicksort(a,j+1,tail); end; Heap-sort procedure heapify(i,n:integer); var l,r,large:integer; begin l:=i*2; r:=i*2+1; large:=i;