home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.prolog
- Path: sparky!uunet!spool.mu.edu!agate!boulder!boulder!citrin
- From: citrin@boulder.Colorado.EDU (Wayne Citrin)
- Subject: Re: Help !!
- Message-ID: <1993Jan21.223806.19004@colorado.edu>
- Sender: news@colorado.edu (The Daily Planet)
- Nntp-Posting-Host: soglio.colorado.edu
- Organization: University of Colorado, Boulder
- References: <lenn.726916615@du9ds4> <j_hamer-210193105028@john-ha.cs.aukuni.ac.nz> <93021.154835U35395@uicvm.uic.edu>
- Date: Thu, 21 Jan 1993 22:38:06 GMT
- Lines: 19
-
- In article <93021.154835U35395@uicvm.uic.edu> C. M. Sperberg-McQueen <U35395@uicvm.uic.edu> writes:
- >Sufficient unto the day is the
- >evil thereof; why should I worry about trivial 'inefficiencies' like
- >those you see in Heiner's code, until they are making my work
- >unacceptably slow?
- >
-
- Because some of us do write large Prolog programs that depend on efficiency,
- and it's better to instill good programming habits from the beginning than to
- overcome bad programming practice later on. Besides, I don't believe that
- Heiner's program is any cleaner: why should the largest item encountered so
- far be placed at the beginning of the list at the next iteration? That seems
- entirely artificial. Why _not_ keep the largest value seen so far as a
- separate quantity?
-
- Wayne
-
- -----------
- Wayne Citrin citrin@soglio.colorado.edu citrin@cs.colorado.edu
-