[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: RECAP & Questions of CPL RECUR Issues.
On Mon, 14 May 2001, Alan Davies wrote:
> At 10:39 AM 14/05/2001 -0700, Eric Busboom wrote:
> >And, if the algorithm is O(n) with number of rules, and actually O(n) with
> >number of BYxxx rule part elements in each rule, then in the general case
> >the algorithm is O(n^2) in the size of the RRULE, a long way from O(1).
> Surely it's O(n) with the number of BYxxx rule part elements
> in all of the rules combined?
Oh yes -- that is more sensible. Anyway, the point still holds -- the
algorithm can't be constant time.