pascal-的排序整理

冒泡排序 Program Const infile sort in outfile sort out Var a Array 1 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 a i Repeat f true For i 1 To n 1 Do If a i a i 1 Then Begin u a i a i a i 1 a i 1 u f false End Until f true For i 1 To n Do Write a i Close input Close output End 快排 Program Const infile sort in outfile qsort out Var a Array 1 1000000 Of Longint i n Longint Procedure quicksort l r Longint Var e x Integer i j Longint Begin i l j r x a Random r l 1 l Repeat While a i x 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 a i quicksort 1 n For i 1 To n Do Write a i Close input Close output End 希尔排序 Program Const infile sort in outfile sort out Var a Array 1 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 a i jump n While jump 1 Do Begin jump jump div 2 Repeat t true For i 1 To n jump Do Begin If a i a i jump Then Begin e a i a i a i jump a i jump e t false End End until t true End For i 1 To n Do Write a i Close input Close output End 选择法排序 Program Const infile sort in outfile sort out Var j n i t Longint a Array 1 1000000 of Longint Begin Assign input infile Assign output outfile Reset input Rewrite output ReadLn n For i 1 To n DO Read a i For i 1 To n 1 Do For j i 1 To n Do If a i a j Then Begin t a i a i a j a j t End For i 1 To n Do Write a i Close input Close output End 冒泡法排序改进 两头 Program Const infile sort in outfile sort out Var a Array 1 1000000 OF 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 a i l 1 R n 1 Repeat f True For i l To r Do If a i a i 1 Then Begin t a i a i a i 1 a i 1 t f false r1 i End If f THen Break r r1 For i r Downto l 1 Do If a i a i 1 Then Begin t a i a i a i 1 a i 1 t l1 i 1 End l l1 Until f For i 1 To n Do Write a i Close input Close output End 基数法排序 Program Const infile sort in outfile sort out bin Array 1 9 Of Longint 1 10 100 1000 10000 100000 1000000 10000000 100000000 Function f x k Longint Longint Begin f x Div bin k mod 10 End Var c a Array 1 100000 Of Longint s Array 0 9 Of lOngint b Array 0 9 Of 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 a i For i 1 TO k Do Begin For j 0 to 9 dO b j 0 For j 1 To n Do Inc b f a j i s 0 b 0 For j 1 To 9 Do s j s