C++冒泡排序

#include <iostream>

using namespace std;

unsigned int num[] = { 21,054,65,1,65,489,8,45,6,787,8 };

void sort(unsigned int* buffer, unsigned int len);

int main(char argc, char** argv)
{
	sort(num, sizeof(num) / sizeof(unsigned int));
	for (int i = 0; i < (sizeof(num) / sizeof(unsigned int)); i++)
	{
		cout << num[i] << endl;
	}

	return 0;
}

void sort(unsigned int* buffer, unsigned int len)
{
	unsigned int* pBuffer = buffer;
	for (int i = len; i; i--)
	{
		pBuffer = buffer;
		for (int j = 0; j < i - 1; j++, pBuffer++)
		{
			if (buffer[j] > buffer[j + 1])
			{
				*pBuffer ^= *(pBuffer + 1);
				*(pBuffer + 1) ^= *pBuffer;
				*pBuffer ^= *(pBuffer + 1);
			}
		}
	}
}