//main.cpp
#include <iostream>
#include "sort.h"

int main()
{
    int *array;
    int size, choice;

    std::cout << "Enter the size of array: ";
    std::cin >> size;
    array = new int[size];

    std::cout << "Enter the array:\n";
    for(int i = 0; i < size; i++)
        std::cin >> array[i];

    std::cout << "Choose the sort method:\n";
    std::cout << "1. Quick sort\n"
              << "2. Bubble sort\n";

    std::cin >> choice;

    switch(choice) {
    case 1:
        TSort sort(void *quickSort);
        break;
    }

    return 0;
}

//sort.h
#ifndef SORT_H
#define SORT_H
#include <iostream>

enum METHOD { QUICKSORT=1, BUBBLESORT };

class TSort
{
    void (*method)(int *array, int first, int last);
public:
    TSort(void (*method));
    void operator()(int *array, int first, int last);
};

void quickSort(int *array, int first, int last);
void bubbleSort(int *array, int first, int last);


#endif // SORT_H

//sort.cpp

#include "sort.h"

TSort::TSort(void (*method)) {
    this->method = method;      // invalid conversion from 'void*' to 'void (*)(int*, int, int)
}

void TSort::operator()(int *array, int first, int last) {
    method(array, first, last);
}

void quickSort(int *array, int first, int last) {
    int i = first;
    int j = last;
    int m = array[(first + last) / 2];

    do {
        while(array[i] < m) i++;
        while(array[j] > m) j--;

        if(i <= j) {
            if(array[i] > array[j]) {
                int temp = array[j];
                array[j] = array[i];
                array[i] = temp;
            }
            i++;
            j++;
        }
    } while(i <= j);

    if(i < last)
        quickSort(array, i, last);
    if(j > first)
        quickSort(array, first, j);
}

void bubbleSort(int *array, int first, int last) {
    for(int i = 0; i < last; i++)
        for(int j = 0; j < last - i; j++)
            if(array[j] > array[j+1]) {
                int temp = array[j];
                array[j] = array[j+1];
                array[j+1] = temp;
            }
}