Ordered versus Unordered Map for Primitive Data Types

A map in programming is an associative container consisting of some key value mapped to some element. C provides two types of map containers within the standard template library, the stdmap and the stdunorderedmap classes. As the name implies, the containers main functional difference is that the elements in the stdmap are ordered by the key, and the stdunorderedmap are not ordered based on their key. The stdunorderedmap elements are placed into buckets based on a hash value computed for their key. This report will concentrate on the performance difference of these two containers using a primitive data type for the key.