Debian Codegraph @

gcc/testsuite/gm2/pim/pass/gcd.mod

raw
1 (* Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc. *)
2 (* This file is part of GNU Modula-2.
3
4 GNU Modula-2 is free software; you can redistribute it and/or modify it under
5 the terms of the GNU General Public License as published by the Free
6 Software Foundation; either version 2, or (at your option) any later
7 version.
8
9 GNU Modula-2 is distributed in the hope that it will be useful, but WITHOUT ANY
10 WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 for more details.
13
14 You should have received a copy of the GNU General Public License along
15 with gm2; see the file COPYING. If not, write to the Free Software
16 Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *)
17 IMPLEMENTATION MODULE gcd ;
18
19
20 FROM StrIO IMPORT WriteLn ;
21 FROM NumberIO IMPORT WriteCard ;
22
23
24 PROCEDURE GreatestCommonDivisor (x, y: CARDINAL) : CARDINAL ;
25 VAR
26 u, v: CARDINAL ;
27 BEGIN
28 u := x ;
29 v := y ;
30 WHILE x#y DO
31 IF x>y
32 THEN
33 DEC(x, y) ;
34 INC(u, v)
35 ELSE
36 DEC(y, x) ;
37 INC(v, u)
38 END
39 END ;
40 RETURN( u+v )
41 END GreatestCommonDivisor ;
42
43
44 VAR
45 d1, d2,
46 answer: CARDINAL ;
47 BEGIN
48 (*
49 d1 := 24 ;
50 d2 := 60 ;
51 *)
52 answer := GreatestCommonDivisor(24, 60) ;
53 WriteCard(answer, 6) ; WriteLn
54 END gcd.