Discussion about this post

User's avatar
Math police's avatar

Hi,

You write "The communication paths between engineers increase exponentially as the team grows in size.", but in fact the total number of communication paths between n nodes is equal to n * (n-1) / 2, which is not an exponential growth, but an polynomial growth (quadratic to be exact), i.e. O(n^2).

Expand full comment
Bogdan Veliscu's avatar

Great read, Neo! In short don’t reinvent the wheel and avoid complexity as long as possible.

Expand full comment
22 more comments...