//This program use the C++ Standard Library list container and list function sort
// A list is declared just like a vector 
//  list<type> variable;
// but has a ready made sort function
#include <iostream>
#include <ctime>
#include <cstdlib>
#include <ctime>

#include <algorithm>
#include <list>


using namespace std;

int main()
{
   const int seed = static_cast<int>(time(0));
   srand(seed);//set randome number differently each run

   const int Biggest = 100000;
   const int Size = 50000;
   const int Sample = 100;

   double total_time =0.0;

   for(int s = 0; s<Sample; s++)
   { 
      list </********/> data;
      for(int i = 0; i< Size; i++)
      {
	   data.push_back(rand()%Biggest);
      }

      time_t time1 = time(0);
      data.sort();
      time_t time2 = time(0);

      total_time+= difftime(time2, time1);
   }

   cout << "Sort List: Size =" << Size << ", mean time =";
   cout << total_time /Sample;

   return 0;
}