一、冒泡排序Bubble sort

https://www.cnblogs.com/kkun/archive/2011/11/23/2260312.html#3824357

#include<iostream>
#include <stdio.h>
#include <stack> 

using namespace std;

void bubble_sort(int *a, int begin, int end) {
    ; i++)
        ; j < end; j++) {
            if (a[i] > a[j]) {
                int temp = a[i];
                a[i] = a[j];
                a[j] = temp;
            }
        }
}

int main()
{
    ] = {, , , , , , , };
    ]);

    bubble_sort(a, , length);
    ; i<; i++) {
        cout << a[i] << " " << endl;
    }
    ;
}