DataMuseum.dk

Presents historical artifacts from the history of:

RegneCentralen GIER Computer

This is an automatic "excavation" of a thematic subset of
artifacts from Datamuseum.dk's BitArchive.

See our Wiki for more about RegneCentralen GIER Computer

Excavated with: AutoArchaeologist - Free & Open Source Software.


top - download

⟦c68adafdd⟧ Bits:30000700 Rangordning., 8-hole paper tape

    Length: 1266 (0x4f2)
    Description: Bits:30000700 Rangordning.
    Types: 8-hole paper tape
    Notes: Gier Text

GIER Text (HTML)

algol<
begin _____
integer m,n,i,j; _______
select(19);writecr; m:=read integer;n:=read integer;
begin _____
real array A[1:m,1:n];real array B[1:m,1:n]; ____ _____ ____ _____
procedure rangordning(m,n,MATRIX,RANGMATRIX); _________
value m,n; _____
integer m,n; _______
real array MATRIX;real array RANGMATRIX; ____ _____ ____ _____
begin _____
integer i,j,k,sum a,sum b; _______
for i:=1 step 1 until m do ___ ____ _____ __
begin _____
for j:=1 step 1 until n do ___ ____ _____ __
begin _____
sum a:=0;sum b:=-1;
for k:=1 step 1 until n do ___ ____ _____ __
begin _____
if MATRIX[i,j]<MATRIX[i,k] then sum a:=sum a+1; __ ____
if MATRIX[i,j]=MATRIX[i,k] then sum b:=sum b+1; __ ____
end; ___
RANGMATRIX[i,j]:=(2⨯(n-sum a)-sum b)/2;
write(|__dd.dd|,RANGMATRIX[i,j]); <,, >
if 10⨯(j_10)-j=0 then writecr; __ : ____
end;writecr; ___
end ___
end procedure rangordning; ___
for i:=1 step 1 until m do ___ ____ _____ __
begin _____
for j:=1 step 1 until n do ___ ____ _____ __
A[i,j]:=read real;
end; ___
rangordning(m,n,A,B);
end ___
end;t< ___