// Written by Mason during class on 2024.10.1
#include <stdio.h>
#include <ctime>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <iostream>
using namespace std;
void randomizeVector(vector<int> &v) {
size_t vsize = v.size();
for (size_t i = 0; i < vsize; i++) {
v[i] = rand();
}
}
clock_t timeSort(int numRuns, int vecSize) {
vector<int> v;
v.resize(vecSize);
clock_t timeTotal = 0;
int currentRuns = 0;
while (currentRuns < numRuns) {
randomizeVector(v);
clock_t t1 = clock();
sort(v.begin(), v.end());
clock_t t2 = clock();
timeTotal += t2 - t1; // delta time
currentRuns++;
}
return timeTotal / numRuns;
}
int main()
{
int vecSize = 100000;
int times = 25; // so we go until 10^(times-1)
for (int i = 0; i < times; i++) {
cout << vecSize << "," << timeSort(10, vecSize) << "\n";
vecSize += 1000000 / times;
}
return 0;
}
