On Tue, Feb 15, 2005 at 11:24:28PM -0500, Benjamin Scott <[EMAIL PROTECTED]>
wrote:
> On Tue, 15 Feb 2005, at 6:26am, [EMAIL PROTECTED] wrote:
> If I have 3 packages, A, B, and C, I need to test A with B, A with C, and
> B with C -- 3 interactions. If I have 4 packages -- A, B, C, and D -- I
> need to test A with each of B, C, and D, and B with each of C and D, and C
> with D: 6 interactions.
FWIW, for the behavior you are describing, the number of interactions is
N*(N-1)/2. In other words, exactly half of the N^2-N behavior you
original thought it was, and still O(N^2), which I think is your point.
Yes, IAAM (I Am A Mathematician) -- or at least I have an undergrad
degree saying that I used to understand this stuff better than I do now.
:-) [ Also note that I'm not justifying your analysis, just provided
the math describing your analysis ]
-- Bob
_______________________________________________
gnhlug-discuss mailing list
gnhlug-discuss@mail.gnhlug.org
http://mail.gnhlug.org/mailman/listinfo/gnhlug-discuss
