//事件冒泡code int main() { int ix; int a[] = {8, 34, 3, 13, 1, 21, 5, 2}; int a_length = (sizeof(a)) / (sizeof(a[0])); // 获得数组的长度s cout << "冒泡排序前:"; for (int ix = 0; ix < a_length; ix++) cout << a[ix] << " "; cout << endl; bubleSort(a, a_length); cout << "冒泡排序后:"; for (int ix = 0; ix < a_length; ix++) cout << a[ix] << " "; cout << endl; return 0; }