冒泡排序小盖饭

//冒泡排序的小改进//设置个信号量change//当某一次没有交换时表明当前数组已有序#include <iostream>#include <stdlib.h>using namespace std;void bubbleSort(int a[], int n){bool change = true;for(int i=n-1; i>=1 && change; --i){change = false;for(int j=0; j<i; ++j){if(a[j] > a[j+1]){swap(a[j],a[j+1]);change = true;}}}}void main(){int a[10] = {1,5,9,3,7,4,0,2,8,6};bubbleSort(a,sizeof(a)/sizeof(a[0]));for(size_t i=0; i < sizeof(a)/sizeof(a[0]); ++i){cout << a[i] ;}}