When it comes to efficiency, there is a huge difference between maps and unordered maps.
We must know the internal working of both to decide which one is to be used.
| map | unordered_map --------------------------------------------------------- Ordering | increasing order | no ordering | (by default) | Implementation | Self balancing BST | Hash Table | like Red-Black Tree | search time | log(n) | O(1) -> Average | | O(n) -> Worst Case Insertion time | log(n) + Rebalance | Same as search Deletion time | log(n) + Rebalance | Same as search
Use std::map when
- You need ordered data.
- You would have to print/access the data (in sorted order).
- You need predecessor/successor of elements.
- See advantages of BST over Hash Table for more cases.
1 : 1 3 : 5 5 : 10 20 : 100
Use std::unordered_map when
- You need to keep count of some data (Example – strings) and no ordering is required.
- You need single element access i.e. no traversal.
1 : 1 3 : 5 20 : 100 5 : 10
- cin get() in C++ with Examples
- Difference between Increment and Decrement Operators
- Difference between Search Engine and Web Browser
- Difference between Opening and Closing in Digital Image Processing
- Map of Vectors in C++ STL with Examples
- Problem in comparing Floating point numbers and how to compare them correctly?
- Difference between Direct and Arbitrated Digital Signature
- Difference between Token based and Non-Token based Algorithms in Distributed System
- exit(0) vs exit(1) in C/C++ with Examples
- Differences between PointToPoint and Publish/subscribe model in JMS
- Differences between Dynamic Binding and Message Passing in Java
- Main difference between Timestamp protocol and Thomos write rule in DBMS
- Difference between Open-Loop Control System and Closed-Loop Control System
- Difference between Fine-Grained and Coarse-Grained SIMD Architecture
- Difference between Arduino and Raspberry Pi
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.