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;
while (J>=K)and(N[J-K]>N[J]) do
begin
IntTemp:=N[J-K];
N[J-K]:=N[J];
N[J]:=IntTemp;
J:=J-K;
end;
end;
K:=K div 2;
end;
end;
delphi 希尔排序类
最新推荐文章于 2022-07-27 15:36:04 发布