冒泡排序

#include <iostream>
using namespace std;
void BubbleSort(int* A, int length);
void Swap(int* A, int lIndex, int rIndex);
int main ()
{
    int arr[] = {3,1,5,2,4,99,8,7};
    int len = sizeof(arr)/sizeof(arr[0]);
    BubbleSort(arr, len);
    for (int i = 0; i < len; ++i)
    {
        cout << arr[i] << "\t";
    }
    cout << endl;
    return 0;
}

void BubbleSort(int* A, int length)
{
    if (A == NULL || length < 1)
    {
        return;
    }

    for (int i = 0; i < length-1; ++i)
    {
        bool bComplete = true;
        for (int j = length-1; j > i; --j)
        {
            if (A[j] < A[j-1])
            {
                Swap(A,j,j-1);
                bComplete = false;
            }
        }

        if (bComplete)
        {
            break;
        }
    }
}

void Swap(int* A, int lIndex, int rIndex)
{
    int tmp = A[lIndex];
    A[lIndex] = A[rIndex];
    A[rIndex] = tmp;
}