C++实现冒泡排序：输出扫描第k遍后的数列结果

```cpp #include <iostream> using namespace std; void bubbleSort(int arr[], int n, int k) { int temp; for (int i = 0; i < k; i++) { for (int j = 0; j < n - i - 1; j++) { if (arr[j] > arr[j + 1]) { temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } } int main() { int n, k; cin >> n >> k; int arr[n]; for (int i = 0; i < n; i++) { cin >> arr[i]; } bubbleSort(arr, n, k); for (int i = 0; i < n; i++) { cout << arr[i] << " "; } cout << endl; return 0; } ``` ######[AI写代码神器 | 235点数解答 | 2024-11-10 15:53:18]