C++优化冒泡排序实现输入整数从大到小排序

```cpp #include <iostream> using namespace std; int main() { int n; cin >> n; int arr[100]; for (int i = 0; i < n; i++) { cin >> arr[i]; } // 优化后的冒泡排序 bool swapped; for (int i = 0; i < n - 1; i++) { swapped = false; for (int j = 0; j < n - i - 1; j++) { if (arr[j] < arr[j + 1]) { swap(arr[j], arr[j + 1]); swapped = true; } } if (!swapped) { break; } } for (int i = 0; i < n; i++) { if (i > 0) { cout << " "; } cout << arr[i]; } return 0; } ``` ######[AI问答 | 257点数解答 | 2026-05-16 20:38:19]