pascal-的排序整理.doc

冒泡排序：Program ;Const infile = sort.in; outfile = sort.out;Var a: Array1.100000 of Longint; f:Boolean;i,n,u:Longint;Begin Assign(input,infile); Assign(output,outfile); Reset(input); Rewrite(output); ReadLn(n); For i := 1 To n Do Read(ai); Repeat f := true; For i := 1 To n-1 Do If ai ai+1Then Begin u:=ai;ai:= ai+1;ai+1:=u;f:=false; End; Until f=true; For i := 1 To n Do Write(ai, ); Close(input); Close(output);End. 快排：Program;Const infile = sort.in; outfile = qsort.out;Var a:Array1.1000000Of Longint;i,n:Longint;Procedure quicksort(l,r:Longint);Var e,x:Integer; i,j:Longint;Begin i:=l;j:=r; x:=aRandom(r-l+1)+l; Repeat While aix Do Dec(j); If i j; If l i Then quicksort(i,r);End;Begin Assign(input,infile); Assign(output,outfile); Reset(input); Rewrite(output); ReadLn(n); For i := 1 To n Do Read(ai); quicksort(1,n); For i := 1 To n Do Write(ai, ); Close(input); Close(output);End. 希尔排序Program ;Const infile = sort.in; outfile = sort.out ;Var a:Array1.1000000 of Integer;t:Boolean; n,jump,i,e:Integer;Begin Assign(input,infile); Assign(output,outfile); Reset(input); Rewrite(output); ReadLn(N); For i := 1 To n Do Read(ai); jump := n; While jump 1 Do Begin jump:=jump div 2; Repeat t:= true; For i := 1 To n - jump Do Begin If aiai+jump Then Begin e := ai;ai:=ai+jump;ai+jump:=e;t:= false; End; End; until t= true; End; For i := 1 To n Do Write(ai, ); Close(input); Close(output);End. 选择法排序Program;Const infile = sort.in; outfile = sort.out;Var j,n,i,t:Longint; a:Array1.1000000of Longint;Begin Assign(input,infile); Assign(output,outfile); Reset(input); Rewrite(output); ReadLn(n); For i := 1 To n DO Read(ai); For i := 1 To n-1 Do For j := i+1 To n Do If aiaj Then Begin t := ai;ai:=aj;aj:=t; End; For i := 1 To n Do Write(ai, ); Close(input); Close(output);End. 冒泡法排序改进（两头）Program;Const infile = sort.in; outfile = sort.out;Var a:Array1.1000000OF Longint; t,I,L,R,N,R1,L1:Longint;f:Boolean;Begin Assign(input,infile); Assign(output,outfile); Reset(input); Rewrite(output); ReadLn(n); For i := 1 To n Do Read(ai); l := 1;R:=n-1; Repeat f := True; For i := l To r Do If aiai+1 Then Begin t:=ai;ai:=ai+1;ai+1:=t;f := false;r1:=i; End; If f THen Break; r := r1; For i := r Downto l+1 Do If aiai-1 Then Begin t:=ai;ai:=ai+1;ai+1:=t;l1:=i-1; End; l := l1; Until f; For i := 1 To n Do Write(ai, ); Close(input); Close(output);End. 基数法排序Program;Const infile = sort.in; outfile = sort.out; bin : Array1.9Of Longint =(1,10,100,1000,10000,100000,1000000,10000000,100000000);Function f(x,k:Longint):Longint;Begin f := x Div bink mod 10;End;Var c,a:Array1.100000Of Longint; s:Array0.9Of lOngint; b:Array0.9Of lOngint; k,j,n,i,x1,x2:Longint;Begin Assign(input,infile); Assign(output,outfile); Reset(input); Rewrite(output); ReadLn(n,k); For i := 1 To n Do Read(ai); For i := 1 TO k Do Begin For j := 0 to 9 dO bj:=0; For j := 1 To n Do Inc(bf(aj,i); s0:=b0; For j := 1 To 9 Do sj:=sj-1+bj