//This uses a C++ Standard Library Multiset to sort a vector of data.
#include <iostream>
#include <ctime>
#include <cstdlib>
#include <ctime>

#include <vector>
#include <set>


using namespace std;


int main()
{
   const int seed = static_cast<int>(time(0));
   srand(seed);//set random 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++)
   { 
      vector <int> data;
      for(int i = 0; i< Size; i++)
      {
	   data.push_back(rand()%Biggest);
      }

      time_t time1 = time(0);
      multiset<int> sorted_data;
      for(int i = 0; i != /**********/; i++)
	sorted_data.insert(data[i]);

      int i=0;
      for(multiset<int>::iterator sd= sorted_data.begin(); sd != sorted_data.end(); sd++)
      {
	data[i]=*sd;
	i++;
      }
      time_t time2 = time(0);

      total_time+= difftime(time2, time1);
   }

   cout << "Sort by Multiset. Size =" << Size << ", mean time =";
   cout << total_time /Sample;

   return 0;
}