排序算法

// 黑白算法之冒泡排序  
  
#include <cstdio>  
#include <cstring>  
#include <algorithm>  
using namespace std;  
  
const int maxn = 1005;  
int a[maxn];  
  
int main() {  
    int n;  
    scanf("%d", &n);  
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);  
    for (int i = 1; i <= n; i++) {  
        for (int j = 1; j < n ;j++) {  
            if (a[j] > a[j + 1]) swap(a[j], a[j + 1]);  
        }  
    }  
    for (int i = 1; i <= n; i++) {  
        printf("%d ", a[i]);  
    }  
    printf("\n");  
    return 0;  
}