kspiteri

"To my mother, Ayn Rand and my daughter" is not ambiguous without the Oxford comma, but would be with it.

> Not if N=1 ;)

> (A constant amount is of course independent of N anyway!)

When using O notation, we're doing asymptotic analysis and n can be arbitrarily large. If you have an arbitrarily large pointer, you cannot store the pointer in a constant number of bits. If your pointer is 64-bits long, you're cannot handle n > 2^64. That is why I said you need O(log n) rather than O(1).

You just need a constant number of pointers. This requires O(log n) scratch space because a pointer can be stored in O(log n) space.

If you can use templates, the decision of which function to call can be done at compile time and you don't need virtual calls. Virtual calls are useful when the decision must be done at runtime.

I think this is the first site I came across that is easier to read as source.

I usually watch soap operas to learn how different people live. It's a pity they messed up the one about start ups.