2 ms·
It doesn't affect your point, but std::map::find is O(log n). std::map is ordered and is typically a tree.
by slavik81 10y ago
It doesn't affect your point, but std::map::find is O(log n). std::map is ordered and is typically a tree.
loading thread…