C++学习：冒泡排序

# include <iostream>
using namespace std;
int main(){
	int arr[10] = {100,21,30000,50,5,0,-95,3,-2,5};
	int N = sizeof(arr)/sizeof(arr[0]); 
	for (int i = N - 1; i>0;i--){
		for (int j = 0; j < i; j++){
			if (arr[j] > arr[j+1]){
				int tmp = 0;
				tmp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1]= tmp;
			}
		}
	}
	for (int i = 0; i < N; i++){
		cout << arr[i]<< endl;
	}
	

    system("pause");
	return 0;
	}