冒泡改进

void bubble_sort2(int a[], int size) {
	int k;
	bool flag;
	k = size;
	flag = true;
	while (flag) {
		flag = false;
		int j;
		for (j = 1; j < k; j++) {
			int temp;
			if (a[j - 1] > a[j]) {
				temp = a[j - 1];
			    a[j - 1] = a[j];
				a[j] = temp;
				flag = true;
			}
		}
		k--;
	}
}

int main() {
	int a[] = {9,4,2,6,1, 1, 1};
	cout << sizeof(a) / sizeof(int)  << endl;
	bubble_sort1(a, sizeof(a) / sizeof(int));
	//bubble_sort1(a, sizeof(a) / sizeof(int));
	int i;
	for (i = 0; i < sizeof(a) / sizeof(int); ++i)
		cout << a[i] << " ";
	cout << endl;
	return 0;
}