#include<iostream> using namespace std; const int maxn = 5000; int main() { void insertion_sort(int A[], int n); void put(int A[], int n); int n, A[maxn]; cin >> n; for(int i = 0; i < n; ++i) cin >> A[i]; insertion_sort(A, n); put(A, n); return 0; } void insertion_sort(int A[], int n) { int key; for(int j = 1; j < n; ++j) { key = A[j]; int i = j - 1; while(i >= 0 && A[i] > key) { A[i+1] = A[i]; --i; } A[i+1] = key; } } void put(int A[], int n) { for(int i = 0; i < n; ++i) cout << A[i] << " "; cout << endl; } //时间复杂度T(n) = Θ(n^2); /* 8 1 7 3 4 6 8 2 5 */