Perf tri rapide

renduTP2/Makefile

 all: sort
 	
-sort : tris.o utils.o main.c
-	gcc -o sort -Wall utils.o tris.o -g main.c
+sort : tris.o utils.o perf.o main.c
+	gcc -o sort -Wall utils.o tris.o perf.o -g main.c
 
 tris.o : tris.c tris.h
 	gcc -c -Wall -g tris.c
@@ -9,5 +9,8 @@ tris.o : tris.c tris.h
 utils.o : utils.c utils.h
 	gcc -c -Wall -g utils.c
 
+perf.o : perf.c perf.h
+	gcc -c -Wall -g perf.c
+
 clean :
 	rm *.o

renduTP2/main.c

@@ -2,6 +2,7 @@
 #include <stdlib.h>
 #include "tris.h"
 #include "utils.h"
+#include "perf.h"
 
 int main(int argc, char *argv[])
 {
@@ -10,17 +11,28 @@ int main(int argc, char *argv[])
     printf("Usage: %s [taille] [typeTableau] [typeAlgo]\n", argv[0]);
     exit(1);
   }
+ 
 
   size_t taille = (size_t)atoi(argv[1]);
   char typeTable = argv[2][0];
   char typeAlgo = argv[3][0];
   long *tab = malloc(sizeof(long) * taille);
+  int *tab_perf = malloc(sizeof(int) * 3);
   long MAX = 10000;
 
   genTable(tab, taille, typeTable, MAX);
 
   switch (typeAlgo)
   {
+  
+  case 't':
+
+
+
+    monitor_triRapide(tab, taille,tab_perf);
+    printf("%d %d %d \n",tab_perf[0],tab_perf[1],tab_perf[2]);
+    break;
+
   case 'i':
     triInsertion(tab, taille);
 
@@ -43,5 +55,6 @@ int main(int argc, char *argv[])
   }
 
   free(tab);
+  free(tab_perf);
   return 0;
 }

renduTP2/perf.c

+#include <math.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include "perf.h"
+
+int recursion = 0;
+int comparaison = 0;
+int permutation = 0;
+int* tab_perf;
+
+void monitor_triRapide(long* A, size_t n, int* tab) {
+    tab_perf = tab;
+    monitor_sousTriRapide(A, 0, n);
+}
+
+void monitor_sousTriRapide(long* A, size_t first, size_t n) {
+    recursion+=1;
+    if(first+1 < n){
+        comparaison+=1;
+        size_t middle = monitor_partition(A,first,n);
+        monitor_sousTriRapide(A,first,middle);
+        monitor_sousTriRapide(A,middle+1,n);
+    }
+    comparaison+=1;
+    tab_perf[0] =recursion; 
+    tab_perf[1] =comparaison; 
+    tab_perf[2] =permutation; 
+
+}
+
+
+size_t monitor_partition(long* A, size_t first, size_t n) {
+    long pivot = A[n-1];
+    size_t i = first;
+    for(int j = first; j+2 <= n; j++){
+        if(A[j] <= pivot){
+            comparaison+=1;
+            monitor_permuter(A,i,j);
+            i++;
+        }
+        comparaison+=1;
+    }
+    monitor_permuter(A,i,n-1);
+    return i;
+}
+
+
+void monitor_permuter(long* A,size_t i,size_t j) {
+    permutation+=1;
+    long inter = A[i];
+    A[i] = A[j];
+    A[j] = inter;
+}
+

renduTP2/perf.h

+#include <stdio.h>
+#include <stdlib.h>
+
+size_t monitor_partition(long* A, size_t first, size_t n);
+void monitor_permuter(long* A,size_t i,size_t j);
+void monitor_sousTriRapide(long* A, size_t first, size_t n);
+void monitor_triRapide(long* A, size_t n,int* tab);
+
+