Question: Has anyone studied the tradeoff between using generic algs and gains for maximal efficiency?
One minute response: What's the alternative to using generic algorithms? Rolling your own? Andrei Alexandrescu had an couple of interesting articles about squeezing the most performance out of sorting. After going totally mad-dog on the code, he got significant (30% or more) speed improvements. But here's the point: if you can fold those changes back into the STL, then you can improve the STL's performance too, and you don't have to go totally mad-dog on the code.
Question: Why is this so complicated.
One minute response: In part because C++ is too jury-rigged to be otherwise, and in part because you haven't got your head re-oriented yet (not that that's something you'd want to do).
This page last modified on 16 July 2003.