title: Testing the C++ Containers - Results for insert and push_back
body: <p>These 4 containers, vector, list, map, unordered_map...are important b.c. they represent some of the most commonly used data structures.  Internally they are represented as a dynamic array, double linked list, a searchable tree, and a hash.</p>
  
  <pre><code>   #include "c_arclib.cpp"
      using namespace std;
      int main()
        {
      /*
      Define - Vector, List, Map, Unordered_map
      */
        vector&lt;int&gt; vector_int;
        list&lt;int&gt; list_int;
        map&lt;int,int&gt; map_int;
        unordered_map&lt;int, int&gt; unordered_map_int; 
      /*
      Define Loop and Time 
      */
        int i,j,loop1=5, loop2=4294967;
        clock_t time_start,time_end,time_diff;
      /*
      Run Timing Test
      */
        for(j=0;j&lt;loop1;j++)
          {
          time_start=clock();
          for(i=0;i&lt;loop2;++i)
            {
            unordered_map_int.insert(pair&lt;int,int&gt;(rand(),rand()));
            /*
            map_int.insert(pair&lt;int,int&gt;(rand(),rand()));
            vector_int.push_back(rand());
            list_int.push_back(rand());
            */
            }
          time_end=clock();
          time_diff=time_end-time_start;
          cout &lt;&lt; time_diff &lt;&lt; endl;
          }
      /*
      Results
      Push / Insert
      map (insert)                    9500
      unorderd_map (insert)           3300
      list (push)                     2600
      vector (push)                   900
      */
  </code></pre>