Question

C++

(a) Write C++ code to create an empty unordered_map container with bucket_count or capacity equal to 15013, and then insert the key-value pairs shown below. Each key is the name of a person, and the associated value is an integer. insert("Johnny", 2502); insert("Ashley", 8765); insert("Tony", 3341); insert("Jessica", 5213); (b) What data structure is typically used to implement the unordered_map container? What data structure is typically used to implement the map container? (c) On average, which container (unordered_map or map) is faster in terms of the insertion and searching/find operations?

Answer 1

Code:

#include<bits/stdc++.h>
using namespace std;

int main(){

// initialize unordered map
unordered_map<string,int>mp;

// assign data to it
mp["Johny"]=2502;
mp["Ashley"]=8765;
mp["Tony"]=3341;
mp["Jessica"]=5213;
  
cout<<mp["Johny"]<<"\n";
cout<< mp["Ashley"]<<"\n";
cout<< mp["Tony"]<<"\n";
cout<<mp["Jessica"]<<"\n";

return 0;
  
}

#include<bits/stdc++.h> using namespace std; int main() { unordered_map<string, int>mp; mp["Johny"]=2502; mp["Ashley"]=8765; mp["Tony"]=3341; mp[ "Jessica"]=5213; cout<<mp ["Johny"]<<"\n"; cout<< mp["Ashley" ]<<"\n"; cout<< mp[ "Tony"]<<"\n"; cout<<mp["Jessica"]<<"\n"; return 0;

2502 8765 3341 5213

Map are implemented via balanced binary search trees precisely Red-black trees.

Unordered_map use hashtables to store data .

Unordered maps are faster with O(1) time to fetch data, while maps take O(logn) time