Bubble Sort Algorithm.cpp

# include <iostream>
# include <algorithm>
using namespace std;

template <class T>
bool ascending(T a, T b){
    return a > b;
}

template <class T>
bool descending (T a, T b){
    return a < b;
}

template <class T>
void display(T *array, const int size){
    for (int iterator = 0; iterator < size; iterator++){
        cout << array[iterator] << " ";
    }
    cout << "\n\n";
}

template <class T>
void bubbleSort(T *const array, const int size, bool (*order)(T, T) = ascending){
    bool swapped = 0;
    for (int iterator = 0; iterator < size-1 ; iterator++){
        for (int iter = 0; iter < size ; iter++){
            swapped = 0;
            if (order(array[iter], array[iter+1])){
                swap(array[iter], array[iter+1]);
                swapped = 1;
            }
        }
        display(array, size);
    }
}