冒泡排序

#include <iostream>
using namespace std;

//exchange the 2 items a and b
void swap(int &a, int &b)
{
    a = a + b;
    b = a - b;
    a = a - b;
}

//ergodic the buf and print it
void ergodic(int  *p,int length)
{
    for (int i = 0; i < length; i++)
    {
        cout << p[i] << " ";
    }
}

void BubbleSort(int  *p, int length)
{
    for (int i = 0; i < 10; i++)
    {
        for (int j = 0; j < 10 - i - 1; j++)
        {
            if (p[j] > p[j + 1])
            {
                swap(p[j], p[j + 1]);
            }
        }
    }
}

int main(int argc, char *args[])
{
    int buf[10] = { 12, 4, 34, 6, 8, 65, 3, 2, 988, 45 };
    int m = sizeof(buf);
    cout << "ÅÅÐòÇ°:" << endl;
    ergodic(buf,sizeof(buf)/sizeof(int));

    BubbleSort(buf, sizeof(buf) / sizeof(int));

    cout << "\n\n\nÅÅÐòºó£º" << endl;
    ergodic(buf, sizeof(buf) / sizeof(int));
    getchar();

}

此处为重点：

 for (int i = 0; i < 10; i++)
    {
        for (int j = 0; j < 10 - i - 1; j++)
        {
            if (p[j] > p[j + 1])
            {
                swap(p[j], p[j + 1]);
            }
        }
    }