#include #include using namespace std; void ins_sort(vector& vec) { for (int i = 1; i < vec.size(); i++) { int j = i - 1; int flag = 0; int temp = vec[i]; while (j >= 0 && vec[j] > temp) { vec[j + 1] = vec[j]; j--; flag++; } vec[j + 1] = temp; if (flag != 0) { for (int i = 0; i < vec.size(); i++) { cout << vec[i] << " "; } cout << endl; } } } signed main() { int N; cin >> N; vector vec(N); for (int i = 0; i < N; i++) cin >> vec[i]; ins_sort(vec); return 0; }