#include #include #include #include "arbrebinaire.h" #include "tas.h" int CompareLexico(void *a,void *b) { return strcmp((char*)a,(char*)b); } int CompareLexicoI(void *a,void *b) { return -CompareLexico((char*)a,(char *)b); } int CompareNum(void *a,void *b) { int s1=0; int s2=0; //(char*)a; //(char*)b; int i=0; int j=1; char * c1=malloc(strlen(a)*sizeof(char)+1); char * c2=malloc(strlen(b)*sizeof(char)+1); strcpy(c1,(char*)a); strcpy(c2,(char*)b); while(c1[i]!='\0') { s1=s1+(int)c1[i]; if(c2[i]!='\0') j=0; if(j) s2=s2+(int)c2[i]; i++; } free(c1); free(c2); return s1-s2; } int CompareNumI(void * a, void*b) { return -CompareNum(a,b); } int main(int argc, char *argv[]) { if(argc>1) { if((strcmp(argv[1],"-i")!=0) || (strcmp(argv[1],"-n")!=0)) { //execution argument normale } else { if((strcmp(argv[2],"-i")!=0) && (strcmp(argv[2],"-n")!=0)) { if(strcmp(argv[1],"-i")==0) { //execution -i } else { //execution -n } } else { //execution -1 -n } } } else { printf("usage : %s [-i] [-n]\n\n-i: inverser l'ordre\n-n: choisir l ordre numerique\n",argv[0]); return 1; } }