begin
A [K, 0]: =K; A [K, 1]: =K+I;
A [K+I, 0]: =K+I; A [K+I, 1]: =K;
end
else
begin
arrangment (K, N div 2);
arrangment (K + N div 2, N div 2); {递归分解原问题与求解子问题}
for I: =K to K + (N div 2) -1 do {合并子问题, 构造原问题的解 A[I,J]} for J: = (N div 2) to N-1 do
A [I, J]:=A [I+(N div 2), J-(N div 2)];
for I:=K+(N div 2) to K+N-1 do
for J:= (N div 2) to N-1 do
A [I, j]:=A [I-(N div 2), J-(N div 2)];
end; end;