Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!watmum!smvorkoetter
From: smvorkoetter@watmum.UUCP
Newsgroups: comp.sys.ibm.pc
Subject: Re: Turbo Out of Memory Prob
Message-ID: <1018@watmum.UUCP>
Date: Sun, 14-Jun-87 15:20:48 EDT
Article-I.D.: watmum.1018
Posted: Sun Jun 14 15:20:48 1987
Date-Received: Sun, 14-Jun-87 19:59:09 EDT
References: <1223@crash.CTS.COM>
Reply-To: smvorkoetter@watmum.UUCP (Stefan M. Vorkoetter)
Organization: U. of Waterloo, Ontario
Lines: 12

In article <1223@crash.CTS.COM> unicorn@pnet01.CTS.COM (Rich Herzog) writes:
|One counter-intuitive time-and-memory optimization is that for scalars,
|n := Succ(n) ;
|takes one less byte than
|n := n + 1 ;
|since it is implemented with an increment rather than an immediate add.
|It you use 6000 of these you're home free ...
|
|--rich

If "n" is an integer (as opposed to a byte), then using Succ() saves two
bytes.  So you'll only need to replace 3000 of them.