Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <time.h>
- #include <algorithm>
- #include <random>
- #include <vector>
- #include <iostream>
- #include <fstream>
- #include <string>
- #include <unordered_map>
- #include <map>
- using namespace std;
- int main() {
- ifstream file;
- file.open("words.txt");
- vector<string> v;
- v.reserve(10000);
- string x;
- while(file >> x)
- v.push_back(x);
- random_shuffle(begin(v),end(v));
- unordered_map<string, int> umap;
- map<string, int> map;
- clock_t tumap, tmap, t;
- for(int i=0;i<v.size();i++){
- t=clock();
- umap[v[i]]=i;
- tumap+=clock()-t;
- t=clock();
- map[v[i]]=i;
- tmap+=clock()-t;
- }
- cout<< tumap/v.size() << " " << tmap/v.size() << endl;
- tumap=0;
- tmap=0;
- for(int i=0;i<v.size();i++){
- t=clock();
- umap.find(v[i]);
- tumap+=clock()-t;
- t=clock();
- map.find(v[i]);
- tmap+=clock()-t;
- }
- cout<< tumap/v.size() << " " << tmap/v.size()<< endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement