Path: utzoo!attcan!uunet!wuarchive!zaphod.mps.ohio-state.edu!lavaca.uh.edu!uhnix1!sugar!ficc!peter
From: peter@ficc.ferranti.com (Peter da Silva)
Newsgroups: comp.unix.questions
Subject: Re: LCM: Least Common Multiplier
Message-ID: <M3M4EU1@xds13.ferranti.com>
Date: 12 Jul 90 14:01:49 GMT
References: <17000004@uicsl.csl.uiuc.edu> <2683@awdprime.UUCP> <1990Jul12.004600.7378@Neon.Stanford.EDU>
Reply-To: peter@ficc.ferranti.com (Peter da Silva)
Organization: Xenix Support, FICC
Lines: 8

In article <1990Jul12.004600.7378@Neon.Stanford.EDU> michaelg@Neon.Stanford.EDU (Michael Greenwald) writes:
>        x2 = lcm (numbers[--n], n, numbers);

Not a good idea. N might be decremented before or after the second use, even
in pre-ANSI compilers. Try:

	n--;
	x2 = lcm(numbers[n], n, numbers);
-- 
Peter da Silva.   `-_-'
+1 713 274 5180.
<peter@ficc.ferranti.com>