Merge Sort

Merge Sort

T tmp[MAX_SIZE]; // 실제 data size 만큼의 tmp 배열이 추가로 필요함
void mergeSort(int s, int e) {
    if (s >= e) return;

}

Time Complexity

• Average: $O(N\log N)$
• Worst: $O(N\log N)$

curl -fsSL 'https://www.readiz.com/notes/algorithm/sort/merge/index.md'