![Why is a[1] fast than a.get(1)](https://cdn.slidesharecdn.com/ss_thumbnails/whyisa1fastthana-150329085113-conversion-gate01-thumbnail.jpg?width=560&fit=bounds)
timingExercise
- 1. #include<random> #include<forward_list> #include<chrono> #include<iostream> #include<ctime> #include<cstdlib> using namespace std; int main() { bool runLoop = true; int n = 0; forward_list<int> randList; while(runLoop) { // Get n from user -- This tells us the # of times to loop cout << "Enter n: "; cin >> n; // Check n to b valid. while n <=0, keep looping while (n <= 0) { cout << "ERROR! n has to be greater than 1. Enter n: "; cin >> n; } cout << "Start Clock"; default_random_engine generator; // c++.com random 111 uniform_int_distribution<int> distribution(-1000,1000);// 111 // Get start time steady_clock::time_point startTime = steady_clock::now(); // chrono steady_clock 22 // Loop n times for (int i=0; i<n; i++) { // Get random # & insert to forward_list int dice_roll = distribution(generator); // 111 randList.insert(dice_roll); } // get end time steady_clock::time_point t2 = steady_clock::now(); // 22 duration<double> time_span = duration_cast<duration<double>>(t2 - t1); // 22 // report total time (endTime - startTime) & n cout << "It took me " << time_span.count() << " seconds to loop " << n << " times." << endl; // 22 cout << "0 to quit n 1 to continue: "; cin >> runLoop; } return 0; }