‹ BackHN Continuity

Thread

Writing Efficient C++ Code (2013)

176 points · 161 comments · ibobev

  1. asveikau · · focus · HN ↗
    This article reminds me of performance advice I was starting to see in the 2000s decade. Basically it was to not introduce a bunch of pointer heavy data structures to get lower algorithmic complexity. Stuff it all into a vector. You will use some algorithms that the computer science textbook will say it's slower, but if it fits all in cache it doesn't matter. The cache misses following pointers all over town hurts you more.
    1. spider-mario · · focus · HN ↗
      Or even, stuff it into several parallel vectors (structure of arrays instead of array of structures).
Open on Hacker News to reply ↗

Unofficial Hacker News client; not affiliated with Y Combinator.