#include <iostream>
#include <time.h>
using namespace std;

#include "quick_sort_basic.h"
#include "quick_sort_array.h"
#include "quick_sort_pointer.h"

int const M = 100000000;

int main( int argc, char *argv[] ) {
	int use_insert = atoi(argv[1]);

	//////////////////////////
	// Create a large array //
	//////////////////////////

	int long_array[M];

	for ( int i = 0; i < M; ++i ) {
		long_array[i] = i*15354943;
	}

	// This takes 0.75 s on eceweb.uwaterloo.ca

	// basic::quick_sort( long_array, M, use_insert );
	// array::quick_sort( long_array, M, use_insert );
	pointer::quick_sort( long_array, M, use_insert );

	return 0;
}