c++利用封装冒泡函数的方式 实现冒泡排序

#include<iostream>
using namespace std;
//封装一个函数，对整形数组进行冒泡排序
void sort(int* arr, int n);
int main()
{
	int arr1[] = { 2,0,3,7,5,7,9,7,10 };
	int * arr = arr1;
	int n = sizeof(arr1) / sizeof(arr1[0]);
	sort( arr1, n);
	cout << "冒泡排序之后数组：" << " ";
	for (int i = 0; i < n; i++)
	{
		cout << *arr <<", ";
		arr++;
	}
};
void sort(int *arr, int n)
{
	for (int i = 0; i < n - 1; i++)
	{
		for (int j = 0; j < n - i - 1; j++)
		{
			if (arr[j] > arr[j + 1])
			{
				int temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = temp;
			}
		}
	}
}