|
DataMuseum.dkPresents historical artifacts from the history of: RegneCentralen GIER Computer |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about RegneCentralen GIER Computer Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - download
Length: 2339 (0x923) Description: Bits:30000767 Spearmans rho (TS) 9 udg Types: 8-hole paper tape Notes: Gier Text, Has Comment, Has_color_3, Parity Errors
algol<begin _____integer i,j,h,k,m,n,s; _______real p,t; ____select(35);writecr;writecr;write cr; 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)); <,, >writete xt(|< 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 __ ____be gin _____write(|_, dd|,k-n); <,_ >writetext(|< elements too many in the datagrou p.|); < >writecr;write cr;writecr;goto abc; ____end; ___end; ___fori:=n-1step -1u ntil1do ___ ____ _____ __forj:=1s tep 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;coaccording to the second row; p:=0;i:=0;m m ent the columns of X have been ordered ___ _______fori:=i+1s tep 1until ndo ___ ____ _____ __begink:=0; _____forj:=ik:=k+1;h -k while j+1_n∧X[2,j]=X[2,j+1] do ___ _____ < __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:=1s tep 1 until n do ___ ____ _____ __begin _____write(|_ddd|,X[1,i]); <, >write(|_______ddd.dddd|,X[2,i]);writecr; <,,,,,,, >end;writecr;writecr;writecr; ___fori:=1s tep 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 significanwritecr;writecr;writecr;c e:|); < >end; ___end; ___end; ___t<
25 parity errors (1.1%) Parity errors are marked in blue.