diff --git a/.vscode/settings.json b/.vscode/settings.json new file mode 100644 index 0000000000000000000000000000000000000000..0f06797c840400ab1e6cf56e1ad97bdd701cfe39 --- /dev/null +++ b/.vscode/settings.json @@ -0,0 +1,5 @@ +{ + "files.associations": { + "stdio.h": "c" + } +} \ No newline at end of file diff --git a/TP1/main b/TP1/main index d1487facee325fdb0d5f18151a49b23445190c91..e1c2a656341bd0b46333d87f12c91f9830e88306 100755 Binary files a/TP1/main and b/TP1/main differ diff --git a/TP1/main.c b/TP1/main.c index 8b03e2fec88d3284aa059b6a394b596c31f87f1e..902db23af3a0915aa8a9c523c5ca388fdef0ff93 100644 --- a/TP1/main.c +++ b/TP1/main.c @@ -6,22 +6,22 @@ int main() { printf("Tri Insertion: \n"); - long triIns[8] ={3,2,8,4,1,6,7,5}; - affichertab(triIns,8); - triInsertion(triIns,8); - affichertab(triIns,8); + long* triIns = listeAlea(100,300); + affichertab(triIns,100); + triInsertion(triIns,100); + affichertab(triIns,100); printf("Tri Rapide: \n"); - long triRap[8] ={3,2,8,4,1,6,7,5}; - affichertab(triRap,8); - triRapide(triRap, 8); - affichertab(triRap,8); + long* triRap = listeAlea(100,300); + affichertab(triRap,100); + triRapide(triRap, 100); + affichertab(triRap,100); printf("Tri Fusion: \n"); - long triFus[8] ={3,2,8,4,1,6,7,5}; - affichertab(triFus,8); - triFusion(triFus, 8); - affichertab(triFus,8); + long* triFus = listeAlea(100,300); + affichertab(triFus,100); + triFusion(triFus, 100); + affichertab(triFus,100); return 0; } diff --git a/TP1/tridec.c b/TP1/tridec.c new file mode 100644 index 0000000000000000000000000000000000000000..96fab4edd959729e0da0317f02e9a47a7b6b4663 --- /dev/null +++ b/TP1/tridec.c @@ -0,0 +1,108 @@ +#include <math.h> +#include <stdlib.h> +#include <stdio.h> +#include "tris.h" + +void triInsertionDec(long* A, size_t n) { + for(size_t i = 1; i <= n-1; i++){ + long cle = A[i]; + size_t j = i - 1; + size_t ecriture=0; + while(j+1 >= j && A[j] > cle){ + ecriture++; + A[j+1] = A[j]; + j = j-1; + } + ecriture++; + A[j+1] = cle; + } +} + +void triFusionDec(long* A, size_t size) { + sousTriFusionDec(A, 0, size); +} + +void sousTriFusionDec(long* A, size_t first, size_t size) { + if(first+1 <size){ // p < r - 1 + size_t middle = floor((first+size)/2); + sousTriFusionDec(A, first, middle); + sousTriFusionDec(A, middle, size); + fusionDec(A, first, middle, size); + } +} + +void copySousTableDec(long* mainT, long* underT, size_t id, size_t size) { + for(size_t i = id; i < id+size; ++i) { + underT[i-id] = mainT[i]; + } +} + +void fusionDec(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); + + copySousTableDec(A, ag, first, n1); + copySousTableDec(A, ad, middle, n2); + + 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] = ad[indd]; + indd++; + } + ++i; + } + + free(ag); + free(ad); +} + +void triRapideDec(long* A, size_t n) { + sousTriRapideDec(A,0,n); +} + +void sousTriRapideDec(long* A, size_t first, size_t size){ + if(first+1 < size){ + size_t middle = partitionDec(A,first,size); + sousTriRapideDec(A,first,middle); + sousTriRapideDec(A,middle+1,size); + } +} + +size_t partitionDec(long* A, size_t first, size_t size) { + long pivot = A[size-1]; + size_t i = first; + for(int j = first; j+2 <= size; j++){ + if(A[j] <= pivot){ + permuterDec(A,i,j); + i++; + } + } + permuterDec(A,i,size-1); + return i; +} + +void permuterDec(long* A,size_t i,size_t j) { + long inter = A[i]; + A[i] = A[j]; + A[j] = inter; +} diff --git a/TP1/tridec.h b/TP1/tridec.h new file mode 100644 index 0000000000000000000000000000000000000000..6b4dbf8aa7ae075c9115fca0a73588967c9c7dde --- /dev/null +++ b/TP1/tridec.h @@ -0,0 +1,17 @@ +#ifndef TRIS_H +#define TRIS_H +#include <stdint.h> +#include <stdlib.h> + +void triInsertionDec(long* A, size_t n); + +void triFusionDec(long* A, size_t size); +void sousTriFusionDec(long* A, size_t first, size_t size); +void fusionDec(long* A, size_t first, size_t middle, size_t size); + +void triRapideDec(long* A, size_t n); +void sousTriRapideDec(long* A, size_t first, size_t size); +size_t partitionDec(long* A, size_t first, size_t size); +void permuterDec(long* A,size_t i,size_t j); + +#endif //TRIS_H \ No newline at end of file diff --git a/TP1/tris.o b/TP1/tris.o index a60fc51aa905726e26b581fcbdde9c80d5f4adfe..3efd234b62b12a752cf80fdb172ff874b2259a64 100644 Binary files a/TP1/tris.o and b/TP1/tris.o differ diff --git a/TP1/utils.c b/TP1/utils.c index be9137a01d4d17a98d52ffb97a0045de94f44ea9..3715ef2ad44103addcb5ba36954139273f0944c5 100644 --- a/TP1/utils.c +++ b/TP1/utils.c @@ -9,3 +9,11 @@ void affichertab(long* T, int s){ } printf("%d ]\n",T[s-1]); } + +long* listeAlea(size_t longeur, size_t N){ + long liste[longeur]; + for(size_t i = 0; i < longeur; i++){ + liste[i] = rand() % N; + } + return liste; +} \ No newline at end of file diff --git a/TP1/utils.h b/TP1/utils.h index 9bc1d220ac2380c3a1096bf8c7205dcd3e8bc196..d36682b4fd5b01fcae7507a775a26abb9a5cc227 100644 --- a/TP1/utils.h +++ b/TP1/utils.h @@ -1,4 +1,5 @@ #include <stdio.h> #include <stdlib.h> -void affichertab(long* T, int s); \ No newline at end of file +void affichertab(long* T, int s); +long* listeAlea(size_t longeur, size_t N); \ No newline at end of file diff --git a/TP1/utils.o b/TP1/utils.o index 4ff1808805cf14b0b2307154829db41bcb7d719c..1efc08401d93d50fd87c0b5a4cc61da2ae97ead8 100644 Binary files a/TP1/utils.o and b/TP1/utils.o differ diff --git a/TP2/Makefile b/TP2/Makefile new file mode 100644 index 0000000000000000000000000000000000000000..0cdad9a10597eafe79ca493957d08725bfab1bd1 --- /dev/null +++ b/TP2/Makefile @@ -0,0 +1,18 @@ +all: main + +main : tri_fusion.o tri_insertion.o tri_rapide.o utils.o main.c + gcc -o main -Wall utils.o tri_fusion.o tri_insertion.o tri_rapide.o -g main.c + +tri_fusion.o : tri_fusion.c tri_fusion.h + gcc -c -Wall -g tri_fusion.c + +tri_insertion.o : tri_insertion.c tri_insertion.h + gcc -c -Wall -g tri_insertion.c + +tri_rapide.o : tri_rapide.c tri_rapide.h + gcc -c -Wall -g tri_rapide.c + +utils.o : utils.c utils.h + gcc -c -g utils.c +clean : + rm *.o diff --git a/TP2/main b/TP2/main new file mode 100755 index 0000000000000000000000000000000000000000..8aa7e2f6f98de4951ed757f8241c66127d10640d Binary files /dev/null and b/TP2/main differ diff --git a/TP2/main.c b/TP2/main.c new file mode 100644 index 0000000000000000000000000000000000000000..15f22bf43e87f29ea8f2bfcff3d9b8c522216c59 --- /dev/null +++ b/TP2/main.c @@ -0,0 +1,29 @@ +#include <stdio.h> +#include <stdlib.h> +#include "tri_insertion.h" +#include "tri_rapide.h" +#include "tri_fusion.h" +#include "utils.h" + + +int main() { + printf("Tri Insertion: \n"); + long* triIns = listeAlea(100,300); + affichertab(triIns,100); + triInsertion(triIns,100); + affichertab(triIns,100); + + printf("Tri Rapide: \n"); + long* triRap = listeAlea(100,300); + affichertab(triRap,100); + triRapide(triRap, 100); + affichertab(triRap,100); + + printf("Tri Fusion: \n"); + long* triFus = listeAlea(100,300); + affichertab(triFus,100); + triFusion(triFus, 100); + affichertab(triFus,100); + + return 0; +} diff --git a/TP2/tri_fusion.c b/TP2/tri_fusion.c new file mode 100644 index 0000000000000000000000000000000000000000..7453f701675217f5c498af12770c5557160a4909 --- /dev/null +++ b/TP2/tri_fusion.c @@ -0,0 +1,62 @@ +#include <math.h> +#include <stdlib.h> +#include <stdio.h> +#include "tri_fusion.h" + +void triFusion(long* A, size_t size) { + sousTriFusion(A, 0, size); +} + +void sousTriFusion(long* A, size_t first, size_t size) { + if(first+1 <size){ // p < r - 1 + size_t middle = floor((first+size)/2); + sousTriFusion(A, first, middle); + sousTriFusion(A, middle, size); + fusion(A, first, middle, size); + } +} + +void copySousTable(long* mainT, long* underT, size_t id, size_t size) { + for(size_t i = id; i < id+size; ++i) { + underT[i-id] = mainT[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); + + copySousTable(A, ag, first, n1); + copySousTable(A, ad, middle, n2); + + 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] = ad[indd]; + indd++; + } + ++i; + } + + free(ag); + free(ad); +} \ No newline at end of file diff --git a/TP2/tri_fusion.h b/TP2/tri_fusion.h new file mode 100644 index 0000000000000000000000000000000000000000..093102cb4f5b15f86b7c7905363bd1f945d04424 --- /dev/null +++ b/TP2/tri_fusion.h @@ -0,0 +1,9 @@ +#ifndef TRIS_F +#define TRIS_F +#include <stdint.h> +#include <stdlib.h> + +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 \ No newline at end of file diff --git a/TP2/tri_fusion.o b/TP2/tri_fusion.o new file mode 100644 index 0000000000000000000000000000000000000000..57f848076bf3faccd72cae9955c14a7837cafb19 Binary files /dev/null and b/TP2/tri_fusion.o differ diff --git a/TP2/tri_insertion.c b/TP2/tri_insertion.c new file mode 100644 index 0000000000000000000000000000000000000000..b276ebd2d589e398fbd838f129fc3a6207dbef76 --- /dev/null +++ b/TP2/tri_insertion.c @@ -0,0 +1,16 @@ +#include <math.h> +#include <stdlib.h> +#include <stdio.h> +#include "tri_insertion.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; + } +} \ No newline at end of file diff --git a/TP2/tri_insertion.h b/TP2/tri_insertion.h new file mode 100644 index 0000000000000000000000000000000000000000..7e92151e6896f0e4c74d4986d79d20bae9595fba --- /dev/null +++ b/TP2/tri_insertion.h @@ -0,0 +1,7 @@ +#ifndef TRIS_I +#define TRIS_I +#include <stdint.h> +#include <stdlib.h> + +void triInsertion(long* A, size_t n); +#endif //TRIS_H \ No newline at end of file diff --git a/TP2/tri_insertion.o b/TP2/tri_insertion.o new file mode 100644 index 0000000000000000000000000000000000000000..49e4a2c00719cbbe22e5c5c9ea0109ae57777da4 Binary files /dev/null and b/TP2/tri_insertion.o differ diff --git a/TP2/tri_rapide.c b/TP2/tri_rapide.c new file mode 100644 index 0000000000000000000000000000000000000000..41eaa3b77e77dd30d53a041ca5f88490cf06a16d --- /dev/null +++ b/TP2/tri_rapide.c @@ -0,0 +1,36 @@ +#include <math.h> +#include <stdlib.h> +#include <stdio.h> +#include "tri_rapide.h" + + +void triRapide(long* A, size_t n) { + sousTriRapide(A,0,n); +} + +void sousTriRapide(long* A, size_t first, size_t size){ + if(first+1 < size){ + size_t middle = partition(A,first,size); + sousTriRapide(A,first,middle); + sousTriRapide(A,middle+1,size); + } +} + +size_t partition(long* A, size_t first, size_t size) { + long pivot = A[size-1]; + size_t i = first; + for(int j = first; j+2 <= size; j++){ + if(A[j] <= pivot){ + permuter(A,i,j); + i++; + } + } + permuter(A,i,size-1); + return i; +} + +void permuter(long* A,size_t i,size_t j) { + long inter = A[i]; + A[i] = A[j]; + A[j] = inter; +} diff --git a/TP2/tri_rapide.h b/TP2/tri_rapide.h new file mode 100644 index 0000000000000000000000000000000000000000..e17099f3db77cc6284f5e220d7f930886672a500 --- /dev/null +++ b/TP2/tri_rapide.h @@ -0,0 +1,10 @@ +#ifndef TRIS_R +#define TRIS_R +#include <stdint.h> +#include <stdlib.h> + +void triRapide(long* A, size_t n); +void sousTriRapide(long* A, size_t first, size_t size); +size_t partition(long* A, size_t first, size_t size); +void permuter(long* A,size_t i,size_t j); +#endif //TRIS_H \ No newline at end of file diff --git a/TP2/tri_rapide.o b/TP2/tri_rapide.o new file mode 100644 index 0000000000000000000000000000000000000000..5c547850da988abefed5dc776249e3da5b941119 Binary files /dev/null and b/TP2/tri_rapide.o differ diff --git a/TP2/utils.c b/TP2/utils.c new file mode 100644 index 0000000000000000000000000000000000000000..21dbdcc29918791537cc35bf417d27c019bbbbf3 --- /dev/null +++ b/TP2/utils.c @@ -0,0 +1,20 @@ +#include <stdio.h> +#include <stdlib.h> +#include "utils.h" + +void affichertab(long* T, int s){ + printf("[ "); + for(int i = 0; i < s-1; i++){ + printf("%d , ",T[i]); + } + printf("%d ]\n",T[s-1]); +} + +long* listeAlea(size_t longueur, size_t N){ + long* liste = malloc(sizeof(long) * longueur); + for(size_t i = 0; i < longueur; i++){ + liste[i] = rand() % N; + } + + return liste; +} \ No newline at end of file diff --git a/TP2/utils.h b/TP2/utils.h new file mode 100644 index 0000000000000000000000000000000000000000..d36682b4fd5b01fcae7507a775a26abb9a5cc227 --- /dev/null +++ b/TP2/utils.h @@ -0,0 +1,5 @@ +#include <stdio.h> +#include <stdlib.h> + +void affichertab(long* T, int s); +long* listeAlea(size_t longeur, size_t N); \ No newline at end of file diff --git a/TP2/utils.o b/TP2/utils.o new file mode 100644 index 0000000000000000000000000000000000000000..9b445ec832566072ed2ebcd07857d1dbb23ba6e5 Binary files /dev/null and b/TP2/utils.o differ