bool unpalindrome (char * T) 
{
   int i=0, j=0;
 
   while (T[j]!='\0') j++;
   
   
   
   i = -1;
   do 
   {
       
      i++;
      j--;
      
      while (!isalpha(T[i])) i++;
      
      //else continue;
 
      while (j >= 0 && !isalpha(T[j])) j--;
      
      //else continue;
 
   }
   while (i<j && T[i]==T[j]);
 
   if (T[i]==T[j]) return true;
 
    else return false;
}




***********************************************


#include <stdio.h>
#include <stdlib.h>


char tab[],chaine[];
int i,j;
long longch = 0;
int main()
{
    
    
    printf("Entrez un mot:\n\n");
    scanf("%s",&chaine);
    
    longch = strlen(chaine);
    j=longch;
    i=0;
    
    for(i=0;i<=longch;i++)
    {
                          for(j=longch;j>=0;j++)
                          {
                                                
                                                if (tab[i]=tab[j])
                                                {
                                                                  printf(" ce mot est palindrome");
                                                                  }
                                                                  
                                                                         if (tab[i]!=tab[j])
                                                                         {
                                                                                     printf(" ce mot est palindrome");
                                                                                       }
                                                                  
                                                                  
}}
  system("PAUSE");	
  return 0;
}
