冒泡排序算法

#include 
using namespace std;
int n = 5 , a[5] = {4 , 1 , 9 , 5 , 1};
int main(){
//冒泡排序 
	for ( int i = 0 ; i < n ; i++ ) {
		for ( int j = 0 ; j < n - i - 1 ; j++ )
			if ( a[j] > a[j + 1] ){
				int p = a[j];
				a[j] = a[j + 1];
				a[j + 1] = p;
			}
	}
	for ( int k = 0 ; k < n ; k++ )
			printf("%d " , a[k]);
			//cout << a[k] << " ";
	return 0;
}