#include <iostream>
#include <cstdlib>
#include <ctime>
#include <algorithm>
using namespace std;

//QUICKSORT using an vector class
inline double secs(clock_t c)
{
	return (double)c/CLOCKS_PER_SEC;
}

const int N =  10000000;
int v[N];

int main()
{
	time_t c;

	cout <<"\ntime start = "
		<< secs(clock()) << "   N = " << N <<
		endl;

	for (int i =0 ; i < N; ++i)
		v[i] = rand();

	//uses a quicksort algorithm

	cout <<"\nstl sort start = "
		<< secs(c = clock());
	sort(v, v + N);
	cout <<"\n stl sort  = "
		<<
		secs(
				clock()-c);
	cout << endl;
}