[C++언어] 병합 정렬 (Merge sort) 알고리즘

#include #include using namespace std; void merge(int *array, int begin, int end) { if(begin < end) { int left_pivot = (begin + end) / 2; int right_pivot = left_pivot + 1; //Divide if (begin != left_pivot) { merge(array, begin, left_pivot); merge(array, right_pivot, end); } //Conquer std::vector temp(end - begin + 1); int first_division = begin; int second_division = right_pivot; int i=0; while (first_division <= left_pivot && second_division <= end) { if (array[first_d...