/* Implement MergeSort() using recursion */
/* Please use the recursion method described in this lab to do this. Otherwise you may lose points even PENALTY POINTS */
/* 請用上課教的遞迴方式寫，否則不但不得分還可能會被倒扣分數！！ */
#include <stdio.h>
#include <stdlib.h>
void merge(int *a, int size1, int size2){
/* a and b's memory must be next to each other and a is ahead of b.
b begins at a[size1]. The merged array should be saved at a's location of
length size1+size 2. */
/* You can modify your Lec 6-2 to fit in this function */
}
void MergeSort(int *arr, int begin_pos, int end_pos){
/*
* Your work here
*/
}
10
67 85 3 2 87 9 56 8 19 48
2 3 8 9 19 48 56 67 85 87