src/Tris/triInsertion.h

+#ifndef triInsertion_h
+#define triInsertion_h
+
+#include <stddef.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <unistd.h>
+#include <fcntl.h>
+#include <string.h>
+
+#include "../Lib/utils.h"
+
+void triInsertion(long* A, size_t n);
+
+void triInsertionVerbose(long* A, size_t n, struct data* d);
+
+#endif
\ No newline at end of file

src/Tris/triRapide.c

+#include "triRapide.h"
+
+void sousTriRapide(long* A, size_t p, size_t r) {
+    size_t max = 0; max--;
+    if(r-1 != max){
+        if (p<(r-1)) {
+            size_t q = partition(A, p, r);
+            sousTriRapide(A, p, q);
+            sousTriRapide(A, q+1, r);
+        }
+    }
+    
+}
+
+size_t partition(long* A, size_t p, size_t r) {
+    long pivot = A[r-1];
+    
+    size_t i = p;
+    for (size_t j = p; j <= r-2; j++) {
+        if (A[j] <= pivot) {
+            long temp = A[i];
+            A[i] = A[j];
+            A[j] = temp;
+            i++;
+        }
+    }
+    long temp = A[i];
+    A[i] = A[r-1];
+    A[r-1] = temp;
+    return i;
+}
+
+void triRapide(long* A, size_t n) {
+    sousTriRapide(A, 0, n);
+}
+
+// --------------------------------------------------------
+
+void sousTriRapideVerbose(long* A, size_t p, size_t r, struct data* d) {
+    size_t max = 0; max--;
+    d->write++;
+    if(r-1 != max){
+        d->comparison++;
+        if (p<(r-1)) {
+            d->comparison++;
+            size_t q = partitionVerbose(A, p, r, d);
+            d->write++;
+            sousTriRapideVerbose(A, p, q, d);
+            sousTriRapideVerbose(A, q+1, r, d);
+        }
+    }
+    
+}
+
+size_t partitionVerbose(long* A, size_t p, size_t r, struct data* d) {
+    long pivot = A[r-1];
+    d->write++;
+    
+    size_t i = p;
+    d->write++;
+    for (size_t j = p; j <= r-2; j++) {
+        if (A[j] <= pivot) {
+            d->comparison++;
+            long temp = A[i];
+            d->write++;
+            A[i] = A[j];
+            d->write++;
+            A[j] = temp;
+            d->write++;
+            i++;
+            d->write++;
+        }
+    }
+    long temp = A[i];
+    d->write++;
+    A[i] = A[r-1];
+    d->write++;
+    A[r-1] = temp;
+    d->write++;
+    return i;
+}
+
+void triRapideVerbose(long* A, size_t n, struct data* d) {
+    sousTriRapideVerbose(A, 0, n, d);
+}
\ No newline at end of file

src/Tris/triRapide.h

+#ifndef triRapide_h
+#define triRapide_h
+
+#include <stddef.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <unistd.h>
+#include <fcntl.h>
+#include <string.h>
+
+#include "../Lib/utils.h"
+
+void triRapide(long* A, size_t n);
+size_t partition(long* A, size_t p, size_t r);
+void sousTriRapide(long* A, size_t p, size_t r);
+
+void triRapideVerbose(long* A, size_t n, struct data* d);
+size_t partitionVerbose(long* A, size_t p, size_t r, struct data* d);
+void sousTriRapideVerbose(long* A, size_t p, size_t r, struct data* d);
+
+#endif
\ No newline at end of file

src/makefile

+all: tri
+
+tri: Lib/main.c Tris/triBulle.o Tris/triInsertion.o Tris/triFusion.o Tris/triRapide.o  Lib/utils.o
+	gcc -Wall Lib/main.c Tris/triInsertion.o Tris/triFusion.o  Tris/triBulle.o Tris/triRapide.o Lib/utils.o -Wall -o tri
+
+insertion: Tris/triInsertion.c Tris/triInsertion.h
+	gcc -c Tris/triInsertion.c Tris/triInsertion.h -Wall
+
+bulle:     Tris/triBulle.c Tris/triBulle.h
+	gcc -c Tris/triBulle.c Tris/triBulle.h -Wall
+
+fusion: Tris/triFusion.c Tris/triFusion.h
+	gcc -c Tris/triFusion.c Tris/triFusion.h -Wall
+
+rapide: Tris/triRapide.c Tris/triRapide.h
+	gcc -c Tris/triRapide.c Tris/triRapide.h -Wall
+
+utils: Lib/utils.c Lib/utils.h
+	gcc -c Lib/utils.c Lib/utils.h -Wall
+
+clear:
+	rm Tris/*.o
\ No newline at end of file

src/manuel.md

+# Manuel 
+
+Pour utiliser les tris, vous avez besoin de 2 choses:<br>
+    - Le binaire `tri`<br>
+    - Un document texte contenant les éléments du tableau, chaque élément est séparé du prochain par un espace et pour finit par un `.`. <br>
+    Ex : `4 3 11 29 .`<br>
+
+Le binaire demande une option et un fichier, le fichier est du type de ceux définit plus haut, quant aux option il en existe plusieures : <br>
+    - `-i` ou `--insertion` pour le tri à insertion<br>
+    - `-f` ou `--fusion` pour le tri à fusion<br>
+    - `-r` ou `--rapide` pour le tri rapide<br>
+    - `-a` ou `--all` pour tout les tris disponibles <br>
\ No newline at end of file

src/tabs/big_tab_1.txt

+40 47 12 2 25 3 14 65 48 10 1 56 94 45 36 27 6 7 19 16 24 38 37 11 78 5 18 54 20 21 82 42 32 22 19 9 53 41 99 125 111 248 33 .
\ No newline at end of file

src/tabs/hypo_tab.txt

+3 6 7 5 3 5 6 2 9 1 2 7 0 9 3 6 0 6 2 6 1 8 7 9 2 0 2 3 7 5 9 2 2 8 9 7 3 6 1 2 9 3 1 9 4 7 8 4 5 0 3 6 1 0 6 3 2 0 6 1 5 5 4 7 6 5 6 9 3 7 4 5 2 5 4 7 4 4 3 0 7 8 6 8 8 4 3 1 4 9 2 0 6 8 9 2 6 6 4 9 .

src/tabs/medium_tab_1.txt

+40 47 12 2 25 3 14 65 48 10 1 56 94 45 36 27 6 7 19 16 24 38 37 11 . 
\ No newline at end of file