Comparative Performance Analysis of std::map and std::unordered_map in C++: Evaluating Efficiency with Large Data Sets
In this assignment you will simulate the ordered and unordered map in C++ to compare performance. You will generate 10,000 and 100,000 random integers and plot graphs of any three operations in the STL library comparing the relationship between the amount of data and execution time of common operations. Submit a pdf document containing:
- Source code
- Three graphs (one for each operation): each graph plotting execution time on y axis and number of data points on x-axis. These graphs can be line graphs that have lines for both data structures in the same graph.
- A one paragraph reflection on what you learned by these graphs.
Note: No need to implement your own maps. Use the maps that are part of STL.
