#include <cstdlib>
#include <iostream>
#include <vector>
#include <ctime>
#include <algorithm>



using namespace std;

void fill (vector<double>& v, int size) {
    srand(time(0));
    for (int i = 0; i <= size; i++) {
        v[i] = (rand() % 10001);
    }
}

void bubblesort (vector<int>& v) {
    for (int border = v.size(); border > 1; border--) {
        for (int i = 0; i < (border-1); i++) {
            if (v[i] > v[i+1]) {
                int temp = v[i];
                v[i] = v[i+1];
                v[i+1] = temp;
                //swap (v[i], v[i+1]);
            }
        }
    }
}



int main() {
    vector<double> v1 (1e5);
    fill (v1, v1.size());
    vector<double> v2 = v1;


    time_t start = clock();
    sort(v1.begin(), v1.end());
    time_t stop = clock();
    cout << "sort aus stdlib: " << (stop - start) << endl;

    start = clock();
    bubblesort (v2);
    stop = clock();
    cout << "Mein eigener sort: " << (stop - start) << endl;
    return 0;
}