排序

1、冒泡排序
// 将数组中最大或者最小值元素后移
#include <iostream>
using namespace std;

void Bubble(int *pArray, const int size)
{
	if (!pArray)
	{
		return;
	}
	bool bFlag = false;
	for (int i = 0; i < size -1; i++)
	{
		bFlag = true;
		for (int j = 0; j < size-i-1; j ++)
		{
			if (pArray[j] < pArray[j+1])
			{
				pArray[j] += pArray[j+1];
				pArray[j+1] = pArray[j] - pArray[j+1];
				pArray[j] = pArray[j] - pArray[j+1];

				bFlag = false;
			}
		}
		
		if (bFlag)
		{
			break;
		}
	}

}

int main()
{
	const int ciSize = 10;
	int a[ciSize] = {2, 3, 5, 6, 8, 9, 1, 5, 2, 4};
	
	Bubble(a, ciSize);

	for (int i = 0; i < ciSize; i++)
	{
		cout << a[i] << endl;
	}

	return 0;
}