Algos_1/algos.c

+#include "algos.h"
+#include <string.h>
+
+void triInsertion(long* A, size_t n){
+    long cle = 0;
+    size_t max = 0; max--;
+    for(size_t i = 1; i<n; i++){
+        cle=A[i];
+        size_t j = i - 1;
+        while (j != max && A[j] > cle ){
+            A[j+1] = A[j];
+            j = j-1;
+        }
+        A[j+1] = cle;
+    }
+}
+
+
+void sousTriFusion(long * A, size_t p, size_t r){
+    if(p<(r-1)){
+        size_t q = (size_t)((p+r)/2);
+        sousTriFusion(A, p, q);
+        sousTriFusion(A, q, r);
+        fusion(A, p, q, r);
+    }
+}
+
+void fusion(long * A, size_t p, size_t q, size_t r){
+    size_t n1 = q-p;
+    size_t n2 = r-q;
+
+    long Ad[n2];
+    memset(Ad, 0, n2);
+    int j =0;
+    for(size_t i = q; i<r; i++){
+        Ad[j] = A[i];
+        j++;
+    }
+
+    long Ag[n1];
+    memset(Ag, 0, n1);
+    j =0;
+    for(size_t i = p; i<q; i++){
+        Ag[j] = A[i];
+        j++;
+    }
+
+    size_t indg = 0;
+    size_t indd = 0;
+    size_t i = p;
+    while (i < r){
+        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] = Ad[indd];
+            indd++;
+        }
+        i++;
+    }
+}
+
+void triFusion(long * A, size_t n){
+    sousTriFusion(A, 0, n);
+}
+
+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);
+}
\ No newline at end of file

Algos_1/algos.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>
+
+
+void triInsertion(long* A, size_t n);
+void sousTriFusion(long * A, size_t p, size_t r);
+void fusion(long * A, size_t p, size_t q, size_t r);
+void triFusion(long * A, size_t n);
+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);

Algos_1/main.c

+#include "triInsertion.h"
+#include "triFusion.h"
+#include "triRapide.h"
+#include "utils.h"
+
+int main(int argc, char **argv){
+    if(argc!=3){
+        printf("Usage: ./tri <option> <input.txt>\n");
+        exit(1);
+    }
+
+    long tab[100];
+    int n = readToTab(tab, argv[2]);
+    struct data data;
+    initData(&data);
+    printf("Base      : ");
+    for(int i  = 0; i<n; i++){
+        printf("%ld,", tab[i]);
+    }
+    printf("\n");
+
+    if((strcmp(argv[1], "--insertion") == 0) || strcmp(argv[1], "-i")== 0){
+        triInsertion(tab, n);
+        printf("Insertion : ");
+        for(int i  = 0; i<n; i++){
+            printf("%ld,", tab[i]);
+        }
+        printf("\n");
+    }
+    else if(strcmp(argv[1], "--fusion")== 0 || strcmp(argv[1], "-f")== 0){
+        triFusion(tab, n);
+        printf("Fusion    : ");
+        for(int i  = 0; i<n; i++){
+            printf("%ld,", tab[i]);
+        }
+        printf("\n");
+    }
+    else if((strcmp(argv[1], "--rapide")== 0) || strcmp(argv[1], "-r")== 0){
+        triRapide(tab, n);
+        printf("Rapide    : ");
+        for(int i  = 0; i<n; i++){
+            printf("%ld,", tab[i]);
+        }
+        printf("\n");
+    }
+    else if (strcmp(argv[1], "-a") == 0)
+    {
+        triInsertion(tab, n);
+        printf("Insertion : ");
+        for(int i  = 0; i<n; i++){
+            printf("%ld,", tab[i]);
+        }
+        printf("\n");
+        triFusion(tab, n);
+        printf("Fusion    : ");
+        for(int i  = 0; i<n; i++){
+            printf("%ld,", tab[i]);
+        }
+        printf("\n");
+        triRapide(tab, n);
+        printf("Rapide    : ");
+        for(int i  = 0; i<n; i++){
+            printf("%ld,", tab[i]);
+        }
+        printf("\n");
+    }
+    else{
+        printf("Usage: ./tri <option> <input.txt>\n");
+    }
+    return 0;
+}
\ No newline at end of file

Algos_1/makefile

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

Algos_1/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

Algos_1/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

Algos_1/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

Algos_1/tabs/test.txt

+3 4 5 6 1 2 9 11 .
\ No newline at end of file

Algos_1/triFusion.c

+#include "triFusion.h"
+
+void sousTriFusion(long * A, size_t p, size_t r){
+    if(p<(r-1)){
+        size_t q = (size_t)((p+r)/2);
+        sousTriFusion(A, p, q);
+        sousTriFusion(A, q, r);
+        fusion(A, p, q, r);
+    }
+}
+
+void fusion(long * A, size_t p, size_t q, size_t r){
+    size_t n1 = q-p;
+    size_t n2 = r-q;
+
+    long Ad[n2];
+    memset(Ad, 0, n2);
+    int j =0;
+    for(size_t i = q; i<r; i++){
+        Ad[j] = A[i];
+        j++;
+    }
+
+    long Ag[n1];
+    memset(Ag, 0, n1);
+    j =0;
+    for(size_t i = p; i<q; i++){
+        Ag[j] = A[i];
+        j++;
+    }
+
+    size_t indg = 0;
+    size_t indd = 0;
+    size_t i = p;
+    while (i < r){
+        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] = Ad[indd];
+            indd++;
+        }
+        i++;
+    }
+}
+
+void triFusion(long * A, size_t n){
+    sousTriFusion(A, 0, n);
+}
+
+// --------------------------------------------------------
+
+void sousTriFusionVerbose(long * A, size_t p, size_t r, struct data* d){
+    if(p<(r-1)){
+        d->comparison++;
+        size_t q = (size_t)((p+r)/2);
+        d->write++;
+        sousTriFusionVerbose(A, p, q,d);
+        sousTriFusionVerbose(A, q, r, d);
+        fusionVerbose(A, p, q, r, d);
+    }
+}
+
+void fusionVerbose(long * A, size_t p, size_t q, size_t r, struct data* d){
+    size_t n1 = q-p;
+    d->write++;
+    size_t n2 = r-q;
+    d->write++;
+
+    long Ad[n2];
+    memset(Ad, 0, n2);
+    d->write+=n2;
+    int j = 0;
+    for(size_t i = q; i<r; i++){
+        Ad[j] = A[i];
+        d->write++;
+        j++;
+        d->write++;
+    }
+
+    long Ag[n1];
+    memset(Ag, 0, n1);
+    d->write+=n1;
+    j = 0;
+    for(size_t i = p; i<q; i++){
+        Ag[j] = A[i];
+        d->write++;
+        j++;
+        d->write++;
+    }
+
+    size_t indg = 0;
+    size_t indd = 0;
+    size_t i = p;
+    d->write++;
+    while (i < r){
+        d->comparison++;
+        if(indg == n1){
+            d->comparison++;
+            A[i] = Ad[indd];
+            d->write++;
+            indd++;
+            d->write++;
+        }
+        else if(indd == n2){
+            d->comparison+=2;
+            A[i] == Ag[indg];
+            d->write++;
+            indg++;
+            d->write++;
+        }
+        else if(Ag[indg] < Ad[indd]){
+            d->comparison+=3;
+            A[i] = Ag[indg];
+            d->write++;
+            indg++;
+            d->write++;
+        }
+        else{
+            d->comparison+=4;
+            A[i] = Ad[indd];
+            d->write++;
+            indd++;
+            d->write++;
+        }
+        i++;
+        d->write++;
+    }
+}
+
+void triFusionVerbose(long * A, size_t n, struct data* d){
+    sousTriFusionVerbose(A, 0, n, d);
+}
\ No newline at end of file

Algos_1/triFusion.h

+#ifndef triFusion_h
+#define triFusion_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 "utils.h"
+
+void sousTriFusion(long * A, size_t p, size_t r);
+void fusion(long * A, size_t p, size_t q, size_t r);
+void triFusion(long * A, size_t n);
+
+void sousTriFusionVerbose(long * A, size_t p, size_t r, struct data* d);
+void fusionVerbose(long * A, size_t p, size_t q, size_t r, struct data* d);
+void triFusionVerbose(long * A, size_t n, struct data* d);
+
+#endif
\ No newline at end of file

Algos_1/triInsertion.c

+#include "triInsertion.h"
+
+void triInsertion(long* A, size_t n){
+    long cle = 0;
+    size_t max = 0; max--;
+    for(size_t i = 1; i<n; i++){
+        cle=A[i];
+        size_t j = i - 1;
+        while (j != max && A[j] > cle ){
+            A[j+1] = A[j];
+            j = j-1;
+        }
+        A[j+1] = cle;
+    }
+}
+
+// --------------------------------------------------------
+
+void triInsertionVerbose(long* A, size_t n, struct data* d){
+    long cle = 0; 
+    size_t max = 0; max--;
+    d->write++;
+    for(size_t i = 1; i<n; i++){
+        cle=A[i];
+        d->write++;
+        size_t j = i - 1;
+        d->write++;
+        while (j != max && A[j] > cle ){
+            d->comparison+=2;
+            A[j+1] = A[j];
+            d->write++;
+            j = j-1;
+            d->write++;
+        }
+        A[j+1] = cle;
+        d->write++;
+    }
+}
\ No newline at end of file

Algos_1/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 "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

Algos_1/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

Algos_1/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 "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

Algos_1/utils.c

+#include "utils.h"
+
+int readToTab(long* tab, char* file){
+    int n = 0;
+    int fd = open(file, O_RDONLY);
+    if(fd == -1){
+        perror("open");
+        exit(1);
+    }
+    char tmp[1000];
+    memset(tmp, 0, 1000);
+    char temp;
+    size_t j = 0, x=0;
+    read(fd,&temp,sizeof(char));
+
+    while(temp != '.'){
+        if(temp != ' '){
+            tmp[x] = temp;
+            x++;
+            
+        }
+        else if(temp == ' '){
+            long t = atol(tmp);
+            tab[j] = t;
+            memset(tmp, 0, 1000);
+            j++;
+            x=0;
+            n++;
+        }
+        read(fd,&temp,sizeof(char));
+    }
+    return n-1;
+}
+
+void initData(struct data* d){
+    d->time = 0;
+    d->comparison = 0;
+    d->ct_fusion = 0;
+    d->ct_parse = 0;
+    d->write = 0;
+}
+
+void generate_tab(long* t, int nb){
+    int taille_tab = 0;
+    if(nb == NULL){
+        taille_tab = (int)(random()+1)%100;
+    }
+    else{
+        taille_tab = nb;
+    }
+
+    for(int i = 0; taille_tab<taille_tab; i++){
+
+    }
+}
\ No newline at end of file