rahmenlose Ansicht.bak DruckansichtAbap {Abap[114] [0] [0]}Entwicklung
*------------------------------------------
* berechne gcd von m und n
* Softwaretechnik Trends Band 44 Heft 4
*------------------------------------------
Identification Division.
Program-Id. GCD.
Author. Andreas Spillner/HS-Bremen.
Data Division.
Working-Storage Section.
77 r pic 9(4).
Linkage Section.
77 n pic 9(4).
77 m pic 9(4).
77 result pic 9(4).
Procedure Division using x, y, z returning result.
* Beispiel mit Fehler!
*
* pre: m>0 and n>0
* post: return >0 and
* [email protected](return) = 0 and
* ...
if n>m then
move m to r
move n to m
move r to n
end-if
move function mod(m,n) to r
perform until r not= 0 with test before
move m to r
move n to m
move r to n
end-perform
move n to result
* result wird zurückgegeben
End-Program GCD.
[ Verzeichnis aufwärts0.112unsichere Verbindung
]
