main.cpp

#include "headers.h"
#include "functions.h"
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;

vector<double> toSort1;
vector<double> toSort2;
vector<double> toSort3;

vector<double> genTimes1;
vector<double> genTimes2;
vector<double> genTimes3;

vector<double> sortTimes1;
vector<double> sortTimes2;
vector<double> sortTimes3;

string fName = "sort_times.txt";
//string fileNames[3] = "BubbleSortResults.txt","SelectionSortResults.txt","InsertionSortResults.txt"
const int range = 1000;

int main(int argc, char** argv) {

srand(time(NULL));
for (int howMany = 100; howMany<=1000000; howMany*=10) {
    // I sortowanie - bubble
    clock_t start=clock();
    randomNumGen(howMany, range, toSort1);
    clock_t finish=clock();
    double gTime = timesDiff(start,finish);
    genTimes1.push_back(gTime);
    clock_t start2 = clock();
    BubbleSort(toSort1);
    clock_t finish2=clock();
    double sTime = timesDiff(start2,finish2);
    sortTimes1.push_back(sTime);

    // II sortowanie - selection
    start=clock();
    randomNumGen(howMany, range, toSort2);
    finish=clock();
    gTime = timesDiff(start,finish);
    genTimes2.push_back(gTime);
    start2 = clock();
    SelectionSort(toSort2);
    finish2=clock();
    sTime = timesDiff(start2,finish2);
    sortTimes2.push_back(sTime);

    // III sortowanie - insertion
    start=clock();
    randomNumGen(howMany, range, toSort3);
    finish=clock();
    gTime = timesDiff(start,finish);
    genTimes3.push_back(gTime);
    start2 = clock();
    InsertionSort(toSort3);
    finish2=clock();
    sTime = timesDiff(start2,finish2);
    sortTimes3.push_back(sTime);

    toSort1.clear();
    toSort2.clear();
    toSort3.clear();
}

writeResults(fName,sortTimes1, sortTimes2, sortTimes3);

system("pause");
/*sort.push_back(1.06);
sort.push_back(5.06);
sort.push_back(3.06);
sort.push_back(2.06);
sort.push_back(1.06);
sort.push_back(7.06);
sort.push_back(9.06);*/

//for (int i=0;i<sort.size();i++)
//cout<< sort[i]<<" ";
//cout<<endl;
//BubbleSort(sort);
//SelectionSort(sort);
//InsertionSort(sort);
//for (int i=0;i<sort.size();i++)
//cout<< sort[i]<<" ";
    return 0;
}