冒泡排序——C++指针版

#include<iostream>
using namespace std;

void BubbleSort(int *arr, int len)
{
	for (int i = 0; i < len-1; i++)
		for (int j = 0; j < len - i - 1; j++)
		{
			//如果j>j+1的值，交换数字
			if (arr[j] > arr[j + 1])
			{
				int tmp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = tmp;
			}
		}
}

void PrintArray(int *arr, int len)
{
	for (int i=0; i < len; i++)
	{
		cout << arr[i] << endl;
	}
}

int main()
{
	int arr[10] = { 2,3,1,5,9,10,12,15,0,4 };
	int len = sizeof(arr)/sizeof(arr[0]);
	BubbleSort(arr, len);
	PrintArray(arr, len);
	waitKey(0);
	return 0;
}