DataMuseum.dk

algol<
begin
_____
integer i,j,h,k,m,n,s;
_______
real p,t;
____
select(35);writecr;writecr;writecr;
m:=read integer;s:=0;
abc:for s:=s+1 step 1 untilm do
    ___        ____   _____  __
 begin
 _____
n:=read integer;k:=0;
 writetext(|<  Datagroup number:|);write(|_dd|,s);
           <                    >        <,  >
 begin
 _____
 realarray X[1:2,1:n+1];writecr;writecr;
 _________
  for j:=1 step 1 untiln do
  ___      ____   _____  __
 begin
 _____
  X[1,j]:=j;X[2,j]:=read real;k:=k+1;
if X[2,j]=0 then
__          ____
    begin
    _____
    write(|__dd|,(n-k+1));
          <,,  >
    writetext(|< elements too few in the datagroup.|);
              <                                    >
    writecr;writecr;writecr;go to abc;
                            __ __
    end;
    ___
 end;p:=read real;
 ___
 fork:=k+1 while p|0 do
 ___       _____  =  __
   begin
   _____
   p:=read real;if p=0then
                __    ____
    begin
    _____
    write(|_,dd|,k-n);
          <,_  >
    writetext(|< elements too many in the datagroup.|);
              <                                     >
writecr;writecr;writecr;goto abc;
                        ____
    end;
    ___
   end;
   ___
fori:=n-1step -1until1do
___      ____   _____ __
forj:=1step 1 until i do
___    ____   _____   __
if X[2,j]>X[2,j+1] then
__                 ____
 begin
 _____
p:=X[2,j];t:=X[1,j];
 X[2,j]:=X[2,j+1];
 X[1,j]:=X[1,j+1];
X[2,j+1]:=p;X[1,j+1]:=t;
 end;comment the columns of X have been ordered
 ___ _______
             according to the second row;
p:=0;i:=0;
fori:=i+1step 1until ndo
___      ____  _____  __
begink:=0;
_____
 forj:=ih-k while j+1_n∧X[2,j]=X[2,j+1] do
 ___        _____    <                  __
k:=k+1;
if k>0then
__    ____
  begin
  _____
  for j:=i+k step -1 until i do
  ___        ____    _____   __
  X[2,j]:=(k+2⨯i)/2;i:=j+k;
  end;
  ___
if k=0 then X[2,i]:=i;
__     ____
 end;
 ___
for i:=1 step 1 until n do
___      ____   _____   __
begin
_____
write(|_ddd|,X[1,i]);
      <,   >
 write(|_______ddd.dddd|,X[2,i]);writecr;
       <,,,,,,,        >
 end;writecr;writecr;writecr;
 ___
fori:=1step 1 until n do
___    ____   _____   __
p:=p+(X[1,i]-X[2,i])∧2;
                    |
t:=1-6⨯p/((n)⨯((n)∧2-1));
                  |
writetext(|<  The Spearman rank correlation coefficient:|);
          <                                             >
write(|_-d.dddd|,t);writecr;
      <,       >
writetext(|<  The number of observations:|);
          <                              >
write(|_ddd|,(n));writecr;
      <,   >
writetext(|<  Level of significance:|);
          <                         >
writecr;writecr;writecr;
end;
___
end;
___
end;
___
t<