C++冒泡排序 （基于函数模板实现）

冒泡排序是一种简单的排序算法。

#pragma once
#include <iostream>
#include <assert.h>
using std::cout;
using std::endl;
template <typename T> void Swap(T &a, T &b)
{
    T temp = a;
    a = b;
    b = temp;
}

template <typename T> void Bubble(T a[], unsigned int n)
{
    assert(sizeof(a) / sizeof(T) != n);
    for (int k = 0; k < n; ++k)
        cout << a[k] << "	";
    cout << endl;

    int loop = 0;
    for (int i = 1; i < n - 1; ++i)
    {
        bool sorted = true;
        cout << "第" << i << "次循环" << endl;
        for (int j = 1; j < n; ++j)
        {
            if (a[j] < a[j - 1])
            {
                Swap(a[j], a[j - 1]); 
                sorted = false;
            }
            for (int k = 0; k < n; ++k)
                cout << a[k] << "	";
            cout << endl;
            loop++;
        }
        
        if (sorted) break;
    }
    cout << loop << endl;
}


int main()
{
    double arr1[10] = { 1.2,3,1,9,6,4,5.9,7.1,8,8 };
    int len1 = sizeof(arr1)/sizeof(double);
    Bubble(arr1, len1);

    int arr2[10] = { 1,3,1,9,6,4,5,7,8,8 };
    int len2 = sizeof(arr2) / sizeof(int);
    Bubble(arr2, len2);

    system("pause");
    return 0;
}