经典排序算法之冒泡排序

#include 
using namespace std;
void swag(int* p1, int* p2)
{
	int tmp = *p1;
	*p1 = *p2;
	*p2 = tmp;
}
int main()
{
	int arr[] = {8,1,5,3,2,7,4,9,6};
	int len = sizeof(arr) / sizeof(arr[0]);
	cout << "排序前：" << endl;
	for (int i = 0; i < len; i++)
	{
		cout << arr[i] << " ";
	}
	cout << endl;

	for (int i = 0; i < len - 1; i++)
	{
		for (int j = 0; j < len - i - 1; j++)
		{
			if (arr[j] > arr[j + 1])
			{
				swag(&arr[j], &arr[j + 1]);
			}
		}
	}
	cout << "排序后" << endl;
	for (int i = 0; i < len; i++)
	{
		cout << arr[i] << " ";
	}

}

输出结果