CS235-DataStructures-Lists/time.cpp at main · jbskaggs/CS235-DataStructures-Lists · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45


#include <iostream>
#include <vector>
#include <list>
#include <time.h>

using std::cout;
using std::endl;

int main () {

  const int listSize = 100000;

  long start;
  long end;

  std::list<int> list;

  cout << endl;
  cout << "inserting " << listSize << " items at the front of a 'list'" << endl;

  start = clock();

  for (int i = 0; i < listSize; i++)
    list.insert(list.begin(), i);

  end = clock();

  cout << "time: " << (end - start) << endl << endl;

  std::vector<int> vector;

  cout << "inserting " << listSize << " items at the front of a 'vector'" << endl;

  start = clock();

  for (int i = 0; i < listSize; i++)
    vector.insert(vector.begin(), i);

  end = clock();

  cout << "time: " << (end - start) << endl << endl;

}