bubbleSort - 冒泡法排序

#include <iostream>#include <string>#include <cstring>#include <cstdlib>#include <cstdio>#include <cmath>#include <vector>#include <stack>#include <deque>#include <queue>#include <bitset>#include <list>#include <map>#include <set>#include <iterator>#include <algorithm>#include <functional>#include <utility>#include <sstream>#include <climits>#include <cassert>#define BUG puts("here!!!");using namespace std;const int N = 50;void bubbleSort(int a[], int len) {    for(int i = 1; i < len; i++) {        for(int j = 0; j < len-i; j++) {            if(a[j] > a[j+1]) swap(a[j], a[j+1]);        }    }}int main() {    int a[] = {8, 5, 4, 9, 2, 3, 6};    bubbleSort(a, 7);    for(int i = 0; i < 7; i++) {        cout << a[i] << ' ';    }    cout << endl;    return 0;}