//This program implements the well known Selection Sort Algorithm 
//Using the Standard Library (page 539 of Scanholm)
//A hand coded replacement is available in timeSelectionSort2.cpp
#include <iostream>
#include <cstdlib>
#include <ctime>

#include <vector>
#include <algorithm>

void sort( vector<int>::iterator begin, vector<int>::iterator end)
{
        for(vector<int>::/******/ k=begin; k != end; k++)
	{
	    iter_swap(k, min_element(k, end));
        }
}

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 = 5000;
   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);
      sort(data.begin(), data.end());
      time_t time2 = time(0);

      total_time+= difftime(time2, time1);
   }

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

   return 0;
}