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
- Greedy approach vs Dynamic programming
- Difference Between BFS and DFS
- Difference between Steganography and Cryptography
- Difference between Strong and Weak Entity
- Difference between Virus, Worm and Trojan Horse
- Difference between Hub and Switch
- Difference between Virtual memory and Cache memory
- Difference between Supercomputer and Mainframe Computer
- Difference between Fast Ethernet and Gigabit Ethernet
- Difference between Network OS and Distributed OS
- Difference between Active Attack and Passive Attack
- Difference between Ethernet and LAN
- Difference between Super Key and Candidate Key
- Difference between Normalization and Denormalization
- Difference between Static and Dynamic Routing
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.