TP1/Makefile

+all: main
+	
+main : tris.o utils.o main.c
+	gcc -o main -Wall utils.o tris.o -g main.c
+
+tris.o : tris.c tris.h
+	gcc -c -Wall -g tris.c
+
+utils.o : utils.c utils.h
+	gcc -o utils.o -c -g utils.c
+clean :
+	rm *.o

TP1/main.c

+#include <stdio.h>
+#include <stdlib.h>
+#include "tris.h"
+#include "utils.h"
+
+
+int main() {
+  long T1[5] ={3,2,5,1,4} ;
+
+  long T2[8] ={3,2,8,4,1,6,7,5} ;
+
+  affichertab(T1,5);
+  printf("\n");
+
+  triInsertion(T1,5);
+
+  affichertab(T1,5);
+
+  return 0;
+}

TP1/tris.c

+#include <math.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include "tris.h"
+
+void triInsertion(long* A, size_t n) {
+    for(size_t i = 1; i <= n-1; i++){
+        long cle = A[i];
+        size_t j = i - 1;
+        while(j+1 >= j && A[j] > cle){
+            A[j+1] = A[j];
+            j = j-1;
+        }
+        A[j+1] = cle;
+    }
+}
+
+void triFusion(long* A, size_t size) {
+  sousTriFusion(A, 0, size);
+  printf("Tri fusion\n");
+}
+
+void sousTriFusion(long* A, size_t first, size_t size) {
+    if(first<size-1){
+        size_t middle = floor((first+size)/2);
+        sousTriFusion(A, first, middle);
+        sousTriFusion(A, middle, size);
+        fusion(A, first, middle, size);
+    }
+    printf("Sous Tri fusion\n");
+}
+
+void copySousTable(long* mainT, long* underT, size_t id, size_t size) {
+  size_t i = 0;
+  for(; id < size; ++id) {
+    mainT[id] = underT[i];
+  }
+}
+
+void fusion(long* A, size_t first, size_t middle, size_t size) {
+    size_t n1 = middle - first; // Nb elem dans A[p , q]  q exclu
+    size_t n2 = size - middle;  // Nb elem dans A[q , r]  r exclu
+
+    size_t indg = 0;
+    size_t indd = 0;
+
+    long* ag = malloc(sizeof(long) * n1);
+    long* ad = malloc(sizeof(long) * n2);
+    printf("Malloc\n");
+
+    copySousTable(A, ag, first, n1);
+    copySousTable(A, ad, middle, n2);
+    printf("CopySousTable\n");
+
+    int i = first;
+
+    while(i < size) {
+      if(indg == n1) {
+        A[i] = ad[indd];
+        indd++;
+      }
+      else if(indd == n2) {
+        A[i] = ag[indg];
+        indg++;
+      }
+      else if(ag[indg] < ad[indd]) {
+        A[i] = ag[indg];
+        indg++;
+      }
+      else {
+        A[i] = ag[indg];
+        indd++;
+      }
+      ++i;
+    }
+
+    free(ag);
+    free(ad);
+}

TP1/tris.h

+#ifndef TRIS_H
+#define TRIS_H
+#include <stdint.h>
+#include <stdlib.h>
+
+void triInsertion(long* A, size_t n);
+
+void triFusion(long* A, size_t size);
+void sousTriFusion(long* A, size_t first, size_t size);
+void fusion(long* A, size_t first, size_t middle, size_t size);
+
+#endif //TRIS_H

TP1/utils.c

+#include <stdio.h>
+#include <stdlib.h>
+#include "utils.h" 
+
+void affichertab(long* T, int s){
+    for(int i = 0; i < s; i++){
+        printf("%d \n",T[i]);
+    } 
+} 
\ No newline at end of file

TP1/utils.h

+#include <stdio.h>
+#include <stdlib.h>
+
+void affichertab(long* T, int s);
\ No newline at end of file

main.c

+#include <stdio.h>
+
+int main( int argc, const char* argv[] )
+{
+    
+}