From 2ec19843ad88ef94aa08e142ce57b62c01776668 Mon Sep 17 00:00:00 2001 From: Miles Bader Date: Tue, 2 Apr 1996 23:33:15 +0000 Subject: Initial revision --- libshouldbeinlibc/lcm.c | 46 ++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 libshouldbeinlibc/lcm.c (limited to 'libshouldbeinlibc') diff --git a/libshouldbeinlibc/lcm.c b/libshouldbeinlibc/lcm.c new file mode 100644 index 00000000..606f4eba --- /dev/null +++ b/libshouldbeinlibc/lcm.c @@ -0,0 +1,46 @@ +/* Lcm (least common multiple), and gcd (greatest common divisor) + + Copyright (C) 1996 Free Software Foundation, Inc. + + Written by Miles Bader + + This file is part of the GNU Hurd. + + The GNU Hurd is free software; you can redistribute it and/or + modify it under the terms of the GNU General Public License as + published by the Free Software Foundation; either version 2, or (at + your option) any later version. + + The GNU Hurd is distributed in the hope that it will be useful, but + WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */ + +/* There are probably more efficient ways to do these... */ + +/* Return the greatest common divisor of p & q. */ +inline long +gcd (long p, long q) +{ + if (p == 0) + return q; + else if (q == 0) + return p; + else if (p == q) + return p; + else if (q > p) + return gcd (q, p); + else + return gcd (q, p % q); +} + +/* Return the least common multiple of p & q. */ +long +lcm (long p, long q) +{ + return (p / gcd (p, q)) * q; +} -- cgit v1.2.3