합병 정렬

Algorithm / 정렬 / Merge Sort (합병 정렬)

합병 정렬 function merge(left_arr, right_arr) { let result = []; let [i, j] = [0, 0]; while (i < left_arr.length && j < right_arr.length) { if (left_arr[i] < right_arr[j]) { result.push(left_arr[i]); i++; } else { result.push(right_arr[j]); j++; } } while (i < left_arr.length) { result.push(left_arr[i]); i++; } while (j < right_arr.length) { result.push(right_arr[j]); j++; } return result; } functio..