home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1993 #3 / NN_1993_3.iso / spool / comp / programm / 3646 < prev    next >
Encoding:
Internet Message Format  |  1993-01-28  |  768 b 
  1. Path: sparky!uunet!opl.com!hri.com!spool.mu.edu!uwm.edu!cs.utexas.edu!torn!nott!emr1!jagrant
  2. From: jagrant@emr1.emr.ca (John Grant)
  3. Newsgroups: comp.programming
  4. Subject: Re: is it possible to find max & next smallest in one pass?
  5. Message-ID: <1993Jan27.223947.4067@emr1.emr.ca>
  6. Date: 27 Jan 93 22:39:47 GMT
  7. References: <1993Jan25.224200.7195@bnlux1.bnl.gov> <eyal.728121809@fir>
  8. Organization: Energy, Mines, and Resources, Ottawa
  9. Lines: 8
  10.  
  11. Thanks to all who responded.  I now have at least a dozen solutions,
  12. most of which are similar.  In fact, the algorithm is relatively simple.
  13. I just didn't think enough about it before posting my question.
  14. Thank you, all of you.
  15. -- 
  16. John A. Grant                        jagrant@emr1.emr.ca
  17. Airborne Geophysics
  18. Geological Survey of Canada, Ottawa
  19.