home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #19 / NN_1992_19.iso / spool / comp / programm / 2470 < prev    next >
Encoding:
Text File  |  1992-08-25  |  854 b   |  21 lines
  1. Newsgroups: comp.programming
  2. Path: sparky!uunet!caen!uwm.edu!psuvax1!schwartz
  3. From: schwartz@roke.cs.psu.edu (Scott Schwartz)
  4. Subject: Re: Teaching the basics
  5. In-Reply-To: markh@csd4.csd.uwm.edu's message of Tue, 25 Aug 1992 17:42:43 GMT
  6. Message-ID: <BtJyAM.MGv@cs.psu.edu>
  7. Sender: news@cs.psu.edu (Usenet)
  8. Nntp-Posting-Host: roke.cs.psu.edu
  9. References: <1992Aug19.154830.11787@uwm.edu> <MJN.92Aug23031941@pseudo.uucp>
  10.     <7116@charon.cwi.nl> <1992Aug25.174243.10436@uwm.edu>
  11. Date: Tue, 25 Aug 1992 19:35:00 GMT
  12. Lines: 7
  13.  
  14. markh@csd4.csd.uwm.edu (Mark) writes:
  15.    Wrong.  In fact, the non-recursive version (tree search) is far smaller and
  16.    simpler.  No stacks either.
  17.  
  18. Actually, the search algorithm is tail recursive, so you can code it
  19. in the straightforward (recursive) way and let the compiler generate
  20. the iterative code.  Gcc and Sun's CC do this.
  21.