Path: utzoo!attcan!uunet!wuarchive!gem.mps.ohio-state.edu!tut.cis.ohio-state.edu!cica!iuvax!rutgers!aramis.rutgers.edu!topaz.rutgers.edu!clong
From: clong@topaz.rutgers.edu (Chris Long)
Newsgroups: comp.sys.atari.st
Subject: Binary Searching
Message-ID: 
Date: 27 Sep 89 20:19:38 GMT
Organization: Rutgers Univ., New Brunswick, N.J.
Lines: 14


I find myself needing a really hot 68000 binary search routine.  This
routine will be called millions of times, so it should be as efficient
as possible.  I need it to go through about 10,000 items, each with a
size of ~ 10 bytes.  Does anyone have something like this already coded?

The most helpful response gets a postcard with an incredibly ugly 
picture of Hill Center, the mathematical and computer sciences
building here.
-- 
Chris Long, 272 Hamilton St. Apt. 1, New Brunswick NJ  08901  (201) 846-5569

"The proofs are so obvious that they can be left to the reader."
Lars V. Ahlfors, _Complex Analysis_