c不太会，pascal我试试。procedure sort(n:longint);var i,j:longint;
k:longint;begin
for i:=1 to (n-1)
for j:=(i+1)to n do if a[j]k do inc (i) ;
for j:=(n+1) downto (i+1) do a[j]:=a[j-1]
a:=k;end;(以上是插入)procedure fanxu;var i,j:longint;begin
for i:=1 to n do b[n-i+1]:=a;end;(反序存放)procedure maxmin;var i,j:longint;
r:real;begin
writeln(b[n]);
writeln(b[1]);
for i:=1 to n do j:=b+j;
r:=j/n;
writeln(r:0:2);end;(最大值、最小值、平均分)
