冒泡排序

伪代码:
A: 数组名
n: 数组长度

BUBBLE-SORT(A, n)
    for i = 0 to n-2
        for j = 0 to n-2-i
            if A[j] > A[j+1]
                swap A[j] with A[j+1]

void bubbleSort(int A[], int n) {
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n - 1 - i; j++) {
            if (A[j] > A[j + 1]) {
                int t = A[j];
                A[j] = A[j + 1];
                A[j + 1] = t;
            }
        }
    }
}