[erlang-questions] erlang-questions Digest, Vol 17, Issue 41

John Haugeland stonecypher@REDACTED
Fri Oct 10 00:29:35 CEST 2008

> > ... in the old fully connected network
> > you need N*(N-1) connections per game, whereas in the new network you
> need
> > 2N connections per game, and exponential vs linear growth, and ...
> N*(N-1) isn't exponential.
> Matt

I'd check that math, if I were you.  Try actually plotting some values, then
ask yourself what the difference is between n**2, n*n, and n*(n-1).  You
might as well suggest that O(a*b) is linear.

If its dominating term governing growth rate is a non-1 exponent, as it is
in this case, it's exponential growth.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://erlang.org/pipermail/erlang-questions/attachments/20081009/79467d21/attachment.htm>

More information about the erlang-questions mailing list