C++BubbleSort-01

#include <iostream>
#include <ctime>
using namespace std;
#define kARRAYCOUNT 20

// 冒泡排序(次方法会修改外部的内容)升序
void bubbleSort(int **array, int count)
{
    if (!array || count <= 0 || count > kARRAYCOUNT)
        return;

    for (int i = 1; i < count; i++)
    {
        for (int j = 0; j < count - i; j++)
        {
            // 从小到大排序
            if ((*array)[j] > (*array)[j + 1])
            {
                int temp = (*array)[j];
                (*array)[j] = (*array)[j + 1];
                (*array)[j + 1] = temp;
            }
        }
    }
}

void printfArray(int *array, int count)
{
    if (!array || count <= 0 || count > kARRAYCOUNT)
        return;

    for (int index = 0; index < kARRAYCOUNT; index++)
    {
        cout << array[index] << " ";
    }
    cout << endl << "---End---" << endl;
}

void main()
{
    int *array = new int[kARRAYCOUNT];

    srand(unsigned(time(0)));

    for (int index = 0; index < kARRAYCOUNT; index++)
    {
        array[index] = rand() % 50 + 20;
    }

    printfArray(array, kARRAYCOUNT);
    
    bubbleSort(&array, kARRAYCOUNT);

    printfArray(array, kARRAYCOUNT);

    getchar();
}