Re: Number of articles

[Dean Giberson <dean.giberson@mindless.com>]

No probelm

Aaron Turner wrote:

> On Fri, 16 Jul 1999, Dean Giberson wrote:
>
> > I believe the Quick sort is n (Log n). The bit field would give n. Also with 1000
> > articles the memory for each hit is 1000 * 4 = 4000 bytes (4 is the size of a
> > pointer). For a bit field it's 1000 / 8 = 125 bytes. That's 32 times difference, I
> > forgot about the size of a pointer when I said 8 times.
> ......

I just want to know up front what you are looking for. I find it's always the best
possible answer if it stands up to others complaints ;-)

However I'm still not sure about this. Do you need the lowest section number? ie:
1.3.76 > 1.3. Or can I just return the first found article? It would change the way it
has to be done.