#include <cmath> #include <iostream> using namespace std; int a[105]; void huafen(int l,int r){ if (l == r) return; int mid = ceil((l + r) / 2); int tmp[105] = {0},tmp2 = {0}; cout << "["; for (int i = l; i <= mid;i++){ cout << a[i] << " "; } cout << "],["; for (int i = mid + 1; i <= r;i++){ tmp2 = a[i]; cout << a[i] << " "; } cout << "]" << endl; huafen(l,mid); huafen(mid + 1,r); } int main(){ int n; cin >> n; for (int i = 1; i <= n; i++){ cin >> a[i]; } huafen(1,n); return 0; }

#include<iostream> using namespace std; int a[105]; void c(int l,int r){ if(l==r) return ; int mid=(l+r)/2; cout<<"["; for(int i=l;i<=mid;i++){ cout<<a[i]<<" "; } cout<<"],["; for(int i=mid+1;i<=r;i++){ cout<<a[i]<<" "; } cout<<"]"<<endl; c(l,mid); c(mid+1,r); } int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } c(1,n); return 0; }

#include<iostream> using namespace std; int n; int a[105]; void acgo(int l,int r){ if(l>=r) return; int mid=(l+r)/2; cout<<"["; for(int i=l;i<=mid;i++){ cout<<a[i]<<" "; } cout<<"],["; for(int i=mid+1;i<=r;i++){ cout<<a[i]<<" "; } cout<<"]"<<endl; acgo(l,mid); acgo(mid+1,r); } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } acgo(1,n); return 0; }

太经典了

#include <bits/stdc++.h> using namespace std; int a[105]; int n; void mergesort(int l, int r){ if(l >= r){ return; } int mid = (l + r) / 2; cout << "["; for(int i = l; i <= r; i++){ cout << a[i] << " "; if(i == mid){ cout << "],["; } } cout << "]" << endl; mergesort(l, mid); mergesort(mid + 1, r); } int main(){ cin >> n; for(int i = 1; i <= n; i++){ cin >> a[i]; } mergesort(1, n); return 0; }

#include<bits/stdc++.h> using namespace std; long long g[1345678],n; void jjb(int a,int b){ if(a >= b) return; int mid = a+b >> 1; cout << "["; for(int i = a;i<=b;i++){ cout<<g[i]<<" "; if(i == mid) cout<<"],["; } cout<<"]\n"; jjb(a,mid); } int main(){ cin >> n; for(int i = 1;i<=n;i++){ cin >> g[i]; } jjb(1,n); }