5.1

#include <iostream>
using namespace std;

int bubbleSort (int *arrayPointer, int size, bool (*f)(int, int), int *swapsPointer, int *comparesPointer)
{
    *swapsPointer = 0;
    *comparesPointer = 0;

    for (int i = 0; i < size - 1; ++i)
        for (int j = 0; j < size - i - 1; ++j)
        {
            if (f(*(arrayPointer + j), *(arrayPointer + j + 1) ) )
            {
                int temp = *(arrayPointer + j);
                *(arrayPointer + j) = *(arrayPointer + j + 1);
                *(arrayPointer + j + 1) = temp;

                ++*swapsPointer;
            }

            ++*comparesPointer;
        }
}

bool ascending (int a, int b)
{
    return a > b;
}

bool descending (int a, int b)
{
    return a < b;
}

int main()
{
    int swaps;
    int compares;
    cout << "Array size = ";
    int size;
    cin >> size;
    cout << endl;
    int array[size];
    int *arrayPointer = &array[0];
    int *swapsPointer = &swaps;
    int *comparesPointer = &compares;

    cout << "Array for ascending sort: ";
    for(int i = 0; i < size; ++i)
        cin >> array[i];

    bubbleSort(arrayPointer, size, ascending, swapsPointer, comparesPointer);  // Ascending sort and output
    cout << "Ascending sort: ";
    for(int i = 0; i < size; ++i)
        cout << *(arrayPointer + i) << ' ';
    cout << endl << "Swaps = " << swaps << ". Compares = " << compares << endl << endl;

    cout << "Array for descending sort: ";
    for(int i = 0; i < size; ++i)
        cin >> array[i];

    bubbleSort(arrayPointer, size, descending, swapsPointer, comparesPointer);  // Descending sort and output
    cout << "Descending sort: ";
    for(int i = 0; i < size; ++i)
        cout << *(arrayPointer + i) << ' ';
    cout << endl << "Swaps = " << swaps << ". Compares = " << compares;

    return 0;
}