Divide and Conquer) Merge Sort C++코드 #include #define FAST ios_base::sync_with_stdio(false),cin.tie(NULL); #define mset(v) memset(v,0,sizeof(v)); #define rep(i,a) for(int i=0;i n; int x; rep(i, n) { cin >> x; v.push_back(x); } mergeSort(0, v.size()); for (int r : v) { cout algorithm 2024.03.10
