Skip to content
Snippets Groups Projects

Compare revisions

Changes are shown as if the source revision was being merged into the target revision. Learn more about comparing revisions.

Source

Select target project
No results found

Target

Select target project
No results found
Show changes
Commits on Source (7)
Hide whitespace changes
Inline Side-by-side
.gitignore 0 → 100644
View file @ 1f1a3beb
*.o
triFusion
triInsertion
triRapide
main
*.gch
main.c 0 → 100644
View file @ 1f1a3beb
#include "tri.h"
int main(int argc,char** argv){
}
makefile 0 → 100644
View file @ 1f1a3beb
all: main triFusion triInsertion triRapide
main: main.c tris.o
gcc -Wall -o $@ $^
%.o: %.c %.h
gcc -Wall -c $^
%: %.c
gcc -Wall -o $@ $^
triFusion.c 0 → 100644
View file @ 1f1a3beb
#include <stdio.h>
#include <stdlib.h>
void copierTableau(long* dest,long* src,size_t n){
for(size_t i = 0;i < n;i++){
dest[i] = src[i];
}
}
void fusion(long* A,size_t p,size_t q,size_t r){
size_t n1 = q-p;
size_t n2 = r-q;
long* Ag = malloc(n1*sizeof(long));
long* Ad = malloc(n2*sizeof(long));
copierTableau(Ag,A+p,n1);
copierTableau(Ad,A+q,n2);
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++;
}
free(Ad);
free(Ag);
}
void sousTriFusion(long* A,size_t p,size_t r){
if(p+1 < r){
size_t q = (p+r)/2;
sousTriFusion(A,p,q);
sousTriFusion(A,q,r);
fusion(A,p,q,r);
}
}
void triFusion(long* A,size_t n){
sousTriFusion(A,0,n);
}
void printTab(long* A,size_t n){
printf("{");
for(size_t i = 0;i < n;i++){
if(i != 0){
printf(",");
}
printf("%ld",A[i]);
}
printf("}\n");
}
int main(int argc,char** argv){
long* A = malloc((argc-1)*sizeof(long));
for(size_t i = 0;i < argc-1;i++){
A[i] = atol(argv[i+1]);
}
printf("Tableau d'entrée: ");
printTab(A,argc-1);
triFusion(A,argc-1);
printf("Tableau de sortie: ");
printTab(A,argc-1);
free(A);
}
triInsertion.c 0 → 100644
View file @ 1f1a3beb
#include <stdio.h>
#include <stdlib.h>
void triInsertion(long* A, size_t n){
for(size_t i = 1; i < n; i ++){
long cle = A[i];
size_t j = i - 1;
while(j + 1 > j && A[j] > cle){ // ici on veut regarder tant que j >= 0
A[j + 1] = A[j];
j = j - 1;
}
A[j + 1] = cle;
}
}
void printTab(long* A,size_t n){
printf("{");
for(size_t i = 0;i < n;i++){
if(i != 0){
printf(",");
}
printf("%ld",A[i]);
}
printf("}\n");
}
int main(int argc, char* argv[]){
long* A = malloc((argc-1)*sizeof(long));
for(size_t i = 0;i < argc-1;i++){
A[i] = atol(argv[i+1]);
}
printf("Tableau d'entrée: ");
printTab(A,argc-1);
triInsertion(A,argc-1);
printf("Tableau de sortie: ");
printTab(A,argc-1);
free(A);
}
triRapide.c 0 → 100644
View file @ 1f1a3beb
#include <stdio.h>
#include <stdlib.h>
void permuter(long* a,long* b){
long tmp = *a;
*a = *b;
*b = tmp;
}
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-1;j++){
if(A[j] <= pivot){
permuter(A+i,A+j);
i++;
}
}
permuter(A+i,A+r-1);
return i;
}
void sousTriRapide(long* A,size_t p,size_t r){
if(p+1 < r){
size_t q = partition(A,p,r);
sousTriRapide(A,p,q);
sousTriRapide(A,q+1,r);
}
}
void triRapide(long* A,size_t n){
sousTriRapide(A,0,n);
}
void printTab(long* A,size_t n){
printf("{");
for(size_t i = 0;i < n;i++){
if(i != 0){
printf(",");
}
printf("%ld",A[i]);
}
printf("}\n");
}
int main(int argc,char** argv){
long* A = malloc((argc-1)*sizeof(long));
for(size_t i = 0;i < argc-1;i++){
A[i] = atol(argv[i+1]);
}
printf("Tableau d'entrée: ");
printTab(A,argc-1);
triRapide(A,argc-1);
printf("Tableau de sortie: ");
printTab(A,argc-1);
free(A);
}
tris.c 0 → 100644
View file @ 1f1a3beb
#include "tris.h"
void copierTableau(long* dest,long* src,size_t n){
for(size_t i = 0;i < n;i++){
dest[i] = src[i];
}
}
void fusion(long* A,size_t p,size_t q,size_t r){
size_t n1 = q-p;
size_t n2 = r-q;
long* Ag = malloc(n1*sizeof(long));
long* Ad = malloc(n2*sizeof(long));
copierTableau(Ag,A+p,n1);
copierTableau(Ad,A+q,n2);
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++;
}
free(Ad);
free(Ag);
}
void sousTriFusion(long* A,size_t p,size_t r){
if(p+1 < r){
size_t q = (p+r)/2;
sousTriFusion(A,p,q);
sousTriFusion(A,q,r);
fusion(A,p,q,r);
}
}
void triFusion(long* A,size_t n){
sousTriFusion(A,0,n);
}
void printTab(long* A,size_t n){
printf("{");
for(size_t i = 0;i < n;i++){
if(i != 0){
printf(",");
}
printf("%ld",A[i]);
}
printf("}\n");
}
void triInsertion(long* A, size_t n){
for(size_t i = 1; i < n; i ++){
long cle = A[i];
size_t j = i - 1;
while(j + 1 > j && A[j] > cle){ // ici on veut regarder tant que j >= 0
A[j + 1] = A[j];
j = j - 1;
}
A[j + 1] = cle;
}
}
void permuter(long* a,long* b){
long tmp = *a;
*a = *b;
*b = tmp;
}
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-1;j++){
if(A[j] <= pivot){
permuter(A+i,A+j);
i++;
}
}
permuter(A+i,A+r-1);
return i;
}
void sousTriRapide(long* A,size_t p,size_t r){
if(p+1 < r){
size_t q = partition(A,p,r);
sousTriRapide(A,p,q);
sousTriRapide(A,q+1,r);
}
}
void triRapide(long* A,size_t n){
sousTriRapide(A,0,n);
}
tris.h 0 → 100644
View file @ 1f1a3beb
#include <stdio.h>
#include <stdlib.h>
void copierTableau(long* dest,long* src,size_t n);
void fusion(long* A,size_t p,size_t q,size_t r);
void sousTriFusion(long* A,size_t p,size_t r);
void triFusion(long* A,size_t n);
void printTab(long* A,size_t n);
void triInsertion(long* A, size_t n);
void permuter(long* a,long* b);
size_t partition(long* A,size_t p,size_t r);
void sousTriRapide(long* A,size_t p,size_t r);
void triRapide(long* A,size_t n);
utils.c 0 → 100644
View file @ 1f1a3beb
#include "utils.h"
void copierTableau(long* dest,long* src,size_t n){
for(size_t i = 0;i < n;i++){
dest[i] = src[i];
}
}
void printTab(long* A,size_t n){
printf("{");
for(size_t i = 0;i < n;i++){
if(i != 0){
printf(",");
}
printf("%ld",A[i]);
}
printf("}\n");
}
void permuter(long* a,long* b){
long tmp = *a;
*a = *b;
*b = tmp;
}
utils.h 0 → 100644
View file @ 1f1a3beb
#include <stdio.h>
#include <stdlib.h>
void copierTableau(long* dest,long* src,size_t n);
void printTab(long* A,size_t n);
void permuter(long* a,long* b);