3 ms·
>because adequate performance is usually trivial to implement with hash tables/arrays/linked lists Are you sure about that? What if your code has to work for b
by maverick_iceman 10y ago
>because adequate performance is usually trivial to implement with hash tables/arrays/linked lists
Are you sure about that? What if your code has to work for billion plus people correctly 99.999% time who are on all different kind of connections?
- krzyk 10y agoCorrect is orthogonal to performant. I would also argue that make a very clever algorithm do correct stuff (and be maintained to do that in the future) is more difficult than do it using simpler method/algo.