제곱시간 미만 정렬합병정렬(merge sort) void merge(vector&arr, int start, int mid, int end){ int leftIdx=start; int rightIdx=mid+1; vector sorted; while (leftIdx & arr, int start, int end){ if (start >= end) return; int mid = (start + end) /2; mergeSort(arr, start, mid); mergeSort(arr, mid+1, end0; merge(arr, start, mid, end); } void solve(){ vector arr={2, -33, 24, 4, 54, 1, 2453, -34..