23 Sep
2011
23 Sep
'11
12:16 p.m.
On 22/09/2011 23:40, David A. Greene wrote:
Dave Abrahams<dave@boostpro.com> writes:
In general, all algorithms in a compiler should be linear, or worst case n*log(n). Any quadratic or worse algorithm is pretty much a bug.
I'd like to think so, too, but I'm not sure all implementors would agree with you.
The problem complexities are not linear or n*log(n) so why should you expect the algorithms to be?
I'm pretty sure Sebastian was talking about front-ends. Nothing in the front-end should be worse than n*log(n).