C++ Help

Started by
10 comments, last by EWClay 11 years, 1 month ago
Oh, it still gets slower as it grows, it just does it at a lower pace.
Advertisement

Oh, it still gets slower as it grows, it just does it at a lower pace.


Tree based maps are O(logN), which is pretty slow growth. But hash maps are constant time, allowing for the occasional resize.

This topic is closed to new replies.

Advertisement