delphi
关注
分享
扫一扫
delphi
网际游侠
86年的程序员,F-basic,开始编程，
展开
-
delphi 堆排序类
delphi 堆排序类procedure HeapAdjust(var N: array of integer; I, IntLen: integer);var IntTmp, IntChild: integer;begin IntTmp := N[I]; IntChild := 2 * I + 1; while IntChild < IntLen do begi...原创 2020-05-06 14:14:40 · 222 阅读 · 0 评论 -
delphi 归并排序类
delphi 归并排序类要先声明typeTIntArr=array of integer;procedure Merge(var X, Y: array of integer; L, M, R: integer);var I, J: integer;begin I := L; J := M + 1; while (L <= M) and (J <= R)...原创 2020-05-06 14:14:03 · 222 阅读 · 0 评论 -
delphi 快速排序类
delphi 快速排序类procedure QuickSort(var N: array of integer; L, R: integer);var I, J, IntTemp: integer;begin if L < R then begin I := L; J := R; IntTemp := N[I]; while I < ...原创 2020-05-06 14:13:11 · 480 阅读 · 0 评论 -
delphi 希尔排序类
delphi 希尔排序类procedure ShellSort(var N:array of integer);var I,J,K,IntTemp:integer;begin K:=High(N) div 2; while K>0 do begin for I := K to High(N) do begin J:=I; wh...原创 2020-05-06 14:12:18 · 167 阅读 · 0 评论 -
delphi 插入排序类
delphi 插入排序类procedure InsertSort(var N:array of integer);var I,J,IntTemp:integer;begin for I := 1 to High(N) do begin for J := I downto 1 do begin if N[J-1]>N[J] then...原创 2020-05-06 14:11:39 · 152 阅读 · 0 评论 -
delphi 选择排序类
procedure SelectSort(var N:array of integer);var I,J,K,IntTemp:integer;begin for I := 0 to High(N)-1 do begin IntTemp:=N[I]; K:=I; for J := I+1 to High(N) do begin if Int...原创 2020-05-06 14:10:26 · 250 阅读 · 0 评论 -
delphi 冒泡排序类
procedure BubbleSort(var N:array of integer);var I,J,IntTemp:integer;begin for I := 0 to High(N) do begin for J := 0 to High(N)-1 do begin if N[J]>N[J+1] then begin ...原创 2020-05-06 14:09:51 · 465 阅读 · 0 评论