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++)
		{
			if (arr[j] > arr[j + 1])
			{
				int t = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = t;
			}
		}
	}
}
void printarry(int * arr, int len)
{
	for (int i = 0; i < len; i++)
	{
		cout << arr[i] << endl;
	}
}
int main()
{
	int arr[10] = { 2,3,5,1,6,8,9,6,5,8 };
	int len=sizeof(arr)/sizeof(arr[0]);

	bubblesort(arr, len);
	printarry(arr, len);
	system("pause");
	
	return 0;
}