From: Martin DeMello Date: 2005-08-06T04:41:07+09:00 Subject: Re: algorithm help 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 :) martin