Program to find palindrome in a string?

Answer 1

#include
#include
void main()
{
char str1[80];
int i,j,flag=1;

printf("enter a word:");
gets(str1);
for(i=0,j= (strlen(str1)-1);i<=(strlen(str1)-1),j>=0;i++,j--)
{
if(str1[i]!=str1[j])
flag=0;
}
if(flag)
printf("palindrome");
else
printf("not a palindrome");
}

Answer 2

#include<iostream.h>

#include<stdio.h>

#include<string.h>

#include<process.h>

void main()

{

char str[50];

int i,l,f;

cout<<"\n\tProgram to check given string is palindrome or not";

cout<<"\n\tEnter a string:";

gets(str);

l=strlen(str);

for(i=0;i<l/2;i++)

{

if(str[i]!=str[l-i-1])

{

cout<<"\n\tNot palindrome";

exit(0);

}

}

cout<<"\n\tPalindrome";

}

//By Gem George

Answer 3

#include

unsigned reverse (unsigned num) {
unsigned dgt, acc = 0;
while (num>0) { dgt = num%10; // determine last digit of num (remainder after division by 10)
rev = rev * 10; // left-shift the accumulator by 1 decimal digit
rev = rev + dgt; // add the digit
num = num / 10; // right-shift the number by 1 decimal digit
}
return acc; // the accumulator is the reverse of original number
}

bool is_palindrome (unsigned num) {
return num == reverse (num);
}

int main (void) {
unsigned num;
printf ("Enter a number greater than zero: ");
scanf ("%u\n", &num);
if (is_palindrome (num))
printf ("The number is a palindrome\n");
else
printf ("The number is not a palindrome\n"); return 0;
}

Answer 4

C Answer#include

#include

#include

int max=0;

int copy(char *str,int n)

{

char *st;

int i;

st=malloc(sizeof(char)*n);

for(i=0;i<=n;i++)

{

st[i]=str[i];

}

st[n+1]='\0';

printf("Palindrome is %s\n",st);

}

int rev(char *s)

{

int j,k,r,len;

len=strlen(s);

for(j=len-1;j>0;j--)

{

k=0;

r=j;

while(k < r && s[k] == s[r])

{

k++;

r--;

}

if(k >= r)

{

//printf("Palindrome Found\n");

if((j+1) > max)

{

max=j+1;

}

copy(s,j);

}

}

}

int palind(char *s)

{

int i,len;

len=strlen(s);

for(i=0;i

{

rev(&s[i]);

}

}

int main()

{

char Sentence[50];

printf("Enter the Sentence\n");

gets(Sentence);

palind(Sentence);

printf("The maximum length is %d",max);

getchar();

return 0;

}

Answer 5

Parse each of the words by detecting spaces (that is, extract one word at a time); use a function to revert the string (most languages have such a function); compare whether the reverted word is equal to the original word.

Answer 6

Remove all spaces and punctuation from the string. Convert the string to lower case. Now copy the string. You now have two strings, a and b. Reverse string b. If a equals b, the string is a palindrome.

Answer 7

Is a typical home-work assignment for beginners.