From: Martin DeMello <martindemello@...>
Date: 2005-08-05T19:26:06+09:00
Subject: Re: algorithm help

"Kroeger Simon (ext)" <simon.kroeger.ext@siemens.com> wrote:
> Hi robert, 
> 
> > [..snip..]
> > This looks cute.  What makes you sure it's O(log n)?
> 
> in fact I think its O(m * log n) with n equals the size of data and m
> the number of ranges.

Yeah, I can't prove it without handwaving, but I think O(m log n) is the
best you can do.

martin