Merge Sort (병합 정렬) #include #include #define SIZE 5 int sorted[SIZE]; void merge(int list[], int left, int mid, int right){ int i, j, k, l; i = left; j = mid+1; k = left; /* 분할 정렬된 list의 합병 */ while(i Computer Science/Algorithm 2020.09.03