[Kamq]

> The easiest way to make things go faster is to do less work. Use a more efficient algorithm, refactor code to eliminate unnecessary operations, move repeated work outside of loops. There are many flavours, but very often the biggest performance boosts are gained by simply solving the same problem through fewer instructions.

I definitely agree with this one, especially on the level of "don't make network calls in your hot loop".

But it should be noted that less efficient algorithms that access memory in a more efficient way (that is to say, get a higher percentage of cache hits when iterating the data) can beat more efficient algorithms that get more cache misses.

That's all to say, iterating over an array is very vast, and iterating through a map is not. Is the map faster if you only need to access a couple things? Well, depends on the dataset size, as well as the constant factor in your map access, and how much of an improvement your other algorithm is.

You should definitely measure that once you've made the change though.

[j45]

Great thing for appealing to what performs better, and then code in that manner.

Simplicity is often the best because necessary complexity will arrive on its own.