DFS 함수 선언

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>

int a[101],n;
int tmp[101]; 

using namespace std;

void merge(int start, int end){
if(start >= end) return;
else	{
	int mid = (start+end)/2;
	merge(start,mid);
	merge(mid+1,end);

	int i = start;
	int j = mid+1;
	int k = start;

	while (i <= mid && j <= end){
	if(a[i] <= a[j]) tmp[k++] = a[i++];
	else tmp[k++] = a[j++];
	}
	if(i <= mid) {
		while(i<=mid){
			tmp[k++] = a[i++];
		}
	}
	else if (j<= end){
		while(j<= end){
			tmp[k++] = a[j++];
		}
	}
	for (int t = start; t <= end; t++){
		a[t] = tmp[t];
	} 

}
}
int main(){
int n;
scanf("%d",&n);
for(int i = 1; i <= n; i++){
	scanf("%d",&a[i]);
}

merge(1,n);

	for (int t = 1; t <= n; t++){
	printf("%d ",tmp[t]);
}

return 0;
}