The ordered and unordered map containers (std::map and std::unordered map) are included in the standard library.
The items in an ordered map are sorted by key, and insert and access are in O (log n).
For ordered maps, the standard library often use red black trees.
However, this is only an implementation detail.
Insert and access are in O in an unordered map (1).
It is simply another term for a hashtable.
An illustration using (ordered) std::map:
#include <map>
#include <iostream>
#include <cassert>
int main(int argc, char ...READ MORE
Jun 10, 2022
in C++
by
Damon
• 4,960 points
•
1,703 views
