string Palindrome
1
7/23/2019 string Palindrome http://slidepdf.com/reader/full/string-palindrome 1/1 int i,n,ch,flag=0; char a[50]; void main() { clrscr(); printf("Enter a string:"); scanf("%s",a); for(i=0;a[i]!='\0';i++); n=i; printf("1:length of string\n2:check whether palindrome or not\n"); printf("Enter your choice"); scanf("%d",&ch); switch(ch) { case 1: printf("Length of string is::%d",i); break; case 2: for(i=0;i<(n/2);i++) { if(a[i]!=a[n-1]) { flag=1; break; } n--; } if(flag) printf("String is not palindrome"); else printf(" palindrome"); break; default: printf("Invalid choice"); } getch(); }
Transcript of string Palindrome
![Page 1: string Palindrome](https://reader035.fdocuments.in/reader035/viewer/2022081805/5695cf4a1a28ab9b028d73a6/html5/thumbnails/1.jpg)
7/23/2019 string Palindrome
http://slidepdf.com/reader/full/string-palindrome 1/1
int i,n,ch,flag=0;char a[50];void main(){clrscr();printf("Enter a string:");scanf("%s",a);
for(i=0;a[i]!='\0';i++);n=i;printf("1:length of string\n2:check whether palindrome or not\n");printf("Enter your choice");scanf("%d",&ch);switch(ch){case 1:
printf("Length of string is::%d",i);break;
case 2:for(i=0;i<(n/2);i++)
{if(a[i]!=a[n-1]){flag=1;break;}
n--;}if(flag)printf("String is not palindrome");elseprintf(" palindrome");break;
default:printf("Invalid choice");}getch();}