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
- Synchronous Chatting Application using C++ boost::asio
- C/C++ For loop with Examples
- Difference between Abstraction and Encapsulation in Java with Examples
- Difference between Functional Programming and Object Oriented Programming
- Difference between LAN and WLAN
- Difference between React.js and Angular.js
- Difference between Blockchain and a Database
- Difference between break and continue in PHP
- Difference between super and super() in Java with Examples
- Difference between WAN and WWAN
- Difference between Binary Tree and Binary Search Tree
- How to input a comma separated string in C++?
- Program to Parse a comma separated string in C++
- Difference between Image Processing and Computer Vision
- Public vs Protected in C++ with Examples
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.