常用算法 By luorine.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