}
}
+/** This quick sort implementation only work with 2^n array size */
void TriFusion(int T[], int n) {
int i = 0, j = 0, k = 0;
int* T1;
int* T2;
T1 = malloc(n/2*sizeof(int));
- T2 = malloc((n - n/2)*sizeof(int));
+ T2 = malloc(n/2*sizeof(int));
if (n > 1) {
for (int i = 0; i < n/2; i++) {
}
int main() {
- int T[] = {4, 2, 7, 3, 8, 1, 6, 5};
+ int T[] = {2, 7, 2, 3, 4, 1, 5, 5};
int tabSize = sizeof(T)/sizeof(T[0]);
AfficheTab(T, tabSize);