#include "Qsort.h"
#include <algorithm>
#include <ctime>


void main() {
    int n = 1000000;
    vector<int> a(n);
    for (int i = 0; i < n; i++) a[i] = (int)(100 * (rand() - 0.5));
    vector<int> b(n);

    for (int i = 0; i < n; i++) b[i] = a[i];
    unsigned int start_time = clock();
    QSort(b, 160);
    unsigned int end_time = clock();
    unsigned int search_time = end_time - start_time;
    printf("%d\n", search_time);

    for (int i = 0; i < n; i++) b[i] = a[i];
    start_time = clock();
    sort(b.begin(), b.end());
    end_time = clock();
    search_time = end_time - start_time;
    printf("%d\n", search_time);

    for (int i = 0; i < n; i++) b[i] = a[i];
    start_time = clock();
    QSort(b, 4);
    end_time = clock();
    search_time = end_time - start_time;
    printf("%d\n", search_time);

    for (int i = 0; i < n; i++) b[i] = a[i];
    start_time = clock();
    QSort(b, 3);
    end_time = clock();
    search_time = end_time - start_time;
    printf("%d\n", search_time);

    for (int i = 0; i < n; i++) b[i] = a[i];
    start_time = clock();
    QSort(b, 2);
    end_time = clock();
    search_time = end_time - start_time;
    printf("%d\n", search_time);

    for (int i = 0; i < n; i++) b[i] = a[i];
    start_time = clock();
    QSort(b, 1);
    end_time = clock();
    search_time = end_time - start_time;
    printf("%d\n", search_time);
}