Tag Archives: performance

Eric Niebler: out parameters, move semantics, and stateful algorithms This post from Eric, inspired by a prompt from Andrei Alexcandrescu, examines the interface of std::getline appraising its usability and performance. Eric looks at a few different designs, in particular those … Continue reading

Link | Posted on by | Tagged , , , , , , | Leave a comment

Why processing a sorted array might be faster than unsorted

I’ve just read this week’s stackoverflow newsletter, and was intrigued by a recent top question “Why is processing a sorted array faster than an unsorted array?” Anyone writing performance-critical processing code should be aware of this; the C++ comparison showed … Continue reading

Posted in Uncategorized | Tagged , , , , | Leave a comment