已经很尽力的在用scanf帮你们省时间了 最好结果O(1)，最坏O(∞) 像我这样的欧皇肯定是一次就ac啦！ 千万要别多次运行卡评测机

你干嘛哈哎呦 就这么多，别看了......

AC

#include<bits/stdc++.h> using namespace std; int a[1010]; int main(){ int n; cin>>n; for(int i=0;i<n;i++){ cin>>a[i]; } sort(a,a+n); for(int i=0;i<n;i++){ cout<<a[i]<<" "; } return 0; }

冒泡排序 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 选择排序 ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ 插入排序

题目学了的就会做，不会的就老老实实地看题解吧！

#include <iostream> void insertion_sort(int arr[], int n) { for (int i = 1; i < n; i++) { int key = arr[i]; int j = i - 1; } int main() { int n; std::cin >> n; int num[n]; }