Question

求数串的原始排列pascal程序

Answer 1

const maxn=100;
var a:array[1..maxn] of integer;
k,t,i,j,n:integer;
begin
write('n=');{输入排序数据个数}
readln(n);
for i:=1 to n do
begin
write('input di',i,'numbers:');
readln(a[i]);{输入排序数据}
end;
for i:=1 to n-1 do{固定格式如果有N个数写N-1内重循环写i+1到N}
begin
k:=i;{赋予比较数据下标}
for j:=i to n do
if a[k]>a[j] then
k:=j;{赋予较小数据小标以便下一次使用}
if k<>i then
begin
t:=a[i];
a[i]:=a[k];
a[k]:=t;
end;
end;
for i:=1 to n do
if i mod 11=0 then writeln
else
write(a[i],' ');
readln;
end.