冒泡排序(C++)

#include <iostream>
using namespace std;

int main()
{
	int arr[9] = {0,1,3,2,4,6,8,9,7};
	for(int i = 0; i < sizeof(arr)/sizeof(arr[0])-1; i++){
		for(int j = 0;j < sizeof(arr)/sizeof(arr[0])-i-1;j++){
			if(arr[j] > arr[j+1]){
				int step = arr[j+1];
				arr[j+1] = arr[j];
				arr[j] = step;
			}
		}
	}
	for(int k = 0; k<sizeof(arr)/sizeof(arr[0]);k++){
		cout << arr[k] << endl; 
	}

	system("pause");
	
	return 0;
}