|
|
|
|
|
by jackmott
3393 days ago
|
|
How do you know the answer you find is a good one? Say you think you need a binary tree, so you can get Log(n) lookup, you look it up, implement it, it works, great. Not bad. Then a lady comes along who actually understands the problem domain, and knows that cache locality will be a big win in this case, and she uses a sorted array with a binary search. Latency is cut in half and the company makes a brazillon dollars. Better. |
|