Closed mertcanekiz closed 8 years ago
I think that better to use unordered_map (hash table; ~O(1) on query) (c++11) because it is faster than usual map (RB tree; (O(log2(size)) + not so pretty hidden constant) on query). PS Sorry for my english
You are right, I have updated my changes
Closed due to being obsolete. If you believe this is still an issue, please submit a new pull request.
I think that better to use unordered_map (hash table; ~O(1) on query) (c++11) because it is faster than usual map (RB tree; (O(log2(size)) + not so pretty hidden constant) on query). PS Sorry for my english