#include <iostream>
#include <vector>
#include <chrono>
#include <random>
#include <algorithm>
 
// Function to perform Bubble Sort
void bubbleSort(std::vector<int>& arr) {
    int n = arr.size();
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n - i - 1; j++) {
            if (arr[j] > arr[j + 1]) {
                std::swap(arr[j], arr[j + 1]);
            }
        }
    }
}
 
// Function to perform Insertion Sort
void insertionSort(std::vector<int>& arr) {
    int n = arr.size();
    for (int i = 1; i < n; i++) {
        int key = arr[i];
        int j = i - 1;
        while (j >= 0 && arr[j] > key) {
            arr[j + 1] = arr[j];
            j--;
        }
        arr[j + 1] = key;
    }
}
 
// Function to perform Quick Sort
int partition(std::vector<int>& arr, int low, int high) {
    int pivot = arr[high];
    int i = (low - 1);
    for (int j = low; j <= high - 1; j++) {
        if (arr[j] < pivot) {
            i++;
            std::swap(arr[i], arr[j]);
        }
    }
    std::swap(arr[i + 1], arr[high]);
    return (i + 1);
}
 
void quickSort(std::vector<int>& arr, int low, int high) {
    if (low < high) {
        int pi = partition(arr, low, high);
        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
    }
}
 
// Function to measure execution time
template <typename Func>
double measureExecutionTime(Func func, std::vector<int>& arr) {
    auto start = std::chrono::high_resolution_clock::now();
    func(arr);
    auto end = std::chrono::high_resolution_clock::now();
    std::chrono::duration<double> duration = end - start;
    return duration.count();
}
 
int main() {
    // Define input sizes
    std::vector<int> inputSizes = {100, 1000, 10000};
 
    for (int inputSize : inputSizes) {
        std::vector<int> arr(inputSize);
 
        // Generate random data
        std::random_device rd;
        std::mt19937 gen(rd());
        std::uniform_int_distribution<int> distribution(1, 10000);
        for (int& value : arr) {
            value = distribution(gen);
        }
 
        // Clone the array for each sorting algorithm
        std::vector<int> bubbleArr = arr;
        std::vector<int> insertionArr = arr;
        std::vector<int> quickArr = arr;
 
        // Measure execution times for each algorithm
        double bubbleTime = measureExecutionTime([&](std::vector<int>& arr) { bubbleSort(arr); }, bubbleArr);
        double insertionTime = measureExecutionTime([&](std::vector<int>& arr) { insertionSort(arr); }, insertionArr);
        double quickTime = measureExecutionTime([&](std::vector<int>& arr) { quickSort(arr, 0, arr.size() - 1); }, quickArr);
 
        std::cout << "Input Size: " << inputSize << std::endl;
        std::cout << "Bubble Sort Execution Time: " << bubbleTime << " seconds" << std::endl;
        std::cout << "Insertion Sort Execution Time: " << insertionTime << " seconds" << std::endl;
        std::cout << "Quick Sort Execution Time: " << quickTime << " seconds" << std::endl;
        std::cout << std::endl;
    }
 
    return 0;
}