5 ms·
In the worst case scenario the time complexity of a hash table equals that of its bucket, which doesn't have to be a list. So the only advantage of the map over
by dfkf 12y ago
In the worst case scenario the time complexity of a hash table equals that of its bucket, which doesn't have to be a list. So the only advantage of the map over the unordered_map seems to be the ease of use, it only needs a comparer.
- nly 12y agounordered_map pretty much has to have linked buckets due to its interface and complexity requirements.