Exercices d'algo

int strcmp(const char*s, const char*t)
{
  while(*s==*t)
    if(*s=='\0') return 0;
  if(*s < *t) return -1;
  return 1;
}

void echanger(char **s, char **t)
{
  char *tmp;
  tmp = *s;
  *s = *t;
  *t = tmp;
}

int Partage(int i,int f,int d)
{
  char *Pos;
  int g=i,d=j;
  echanger(&Pos[p],&Pos[f]);
  char pivot = Pos[f];
  do
    {
      while(Pos[g]< pivot)
	g=g+1;
      while(d >= g && Pos[d] >=pivot)
	d=d-1;
      if(g < d)
	{
	  echanger(&Pos[g],&Pos[d]);
	  g=g+1;
	  d=d-1;
	}
    }while(g>d)
    return g;    
}

typedef struct noeud 
{
  int val;
  struct noeud *g,d;
}Noeud ;

typedef Noeud *Arbre;


void Str(Arbre A)
{
  printf('0');
  while(A->g->g !=NULL)
    {
      printf('0');
      A = A->g;
    }
  printf('1');
  while(A->d->d !=NULL)
    {
      printf('0');
      A = A->d;
    }
  printf('1');
}

/* Comparaison des chaines s et t comme suit :  s>t: >0  s==t: 0  s<t: <0 */
int strcmp(const char *s, const char *t) {
    if (s == t) return (0);
    while (*s == *t++)
        if (*s++ == '\0')
            return (0);
    return (*(unsigned char *)s - *(unsigned char *)--t);
}

y[]="maison"

pos[]={1,2,0,5,4}