C++基础 数组

#include 
using namespace std;

//冒泡排序
void maoPao(int* arr) {
	int n = sizeof(arr) / sizeof(arr[0]);
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n - i - 1; j++) {
			if (arr[i] > arr[j]) {
				int temp = arr[i];
				arr[i] = arr[j];
				arr[j] = temp;
			}
		}
	}
}


int main5() {
	int array[] = {0,1,2,3,4,5,6,7,8,9};

	cout << sizeof(array) << endl;
	cout << sizeof(array[0]) << endl;
	cout << array << endl;

	cout << "n" << endl;//换行


	system("pause");
	return 0;

}