From: "Ara.T.Howard" Date: 2005-08-06T06:01:06+09:00 Subject: Re: algorithm help On Sat, 6 Aug 2005, Martin DeMello wrote: > Ara.T.Howard wrote: >> i think worst case proves it: >> >> [1,2,3] >> >> three ranges, ergo m, log(n) to find the ends is well proven since it's just >> binary search. > > [1,3,5] you mean :) details details. sheesh. -a -- =============================================================================== | email :: ara [dot] t [dot] howard [at] noaa [dot] gov | phone :: 303.497.6469 | My religion is very simple. My religion is kindness. | --Tenzin Gyatso ===============================================================================