{"id":26517,"date":"2017-05-31T18:06:19","date_gmt":"2017-05-31T12:36:19","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26517"},"modified":"2017-05-31T18:06:19","modified_gmt":"2017-05-31T12:36:19","slug":"c-program-for-palindrome","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-program-for-palindrome\/","title":{"rendered":"C program for palindrome"},"content":{"rendered":"

C program for palindrome or palindrome in c programming: palindrome <\/a>program in c language, c code to check if a string is a palindrome or not and for palindrome number. This program works as follows :- at first we copy the entered string into a new string, and then we reverse the new string and then compares it with original string. If both of them have same sequence of characters i.e. they are identical then the entered string is a palindrome otherwise not. To perform copy, reverse and compare operations we use strcpy, strrev and strcmp functions of string.h respectively, if you do not wish to use these functions see c programming code for palindrome without using string functions. Some palindrome strings examples are “a”, dad”, “radar”, “madam”, “abcba” etc.<\/p>\n[ad type=”banner”]\n

C program for palindrome<\/h2>\n
<\/div> 
#include <stdio.h>#include <string.h> int main(){   char a[100], b[100];    printf("Enter the string to check if it is a palindrome\\n");   gets(a);    strcpy(b,a);   strrev(b);    if (strcmp(a,b) == 0)      printf("Entered string is a palindrome.\\n");   else      printf("Entered string is not a palindrome.\\n");    return 0;}<\/code><\/pre> <\/div>\n
Output of program:<\/strong><\/p>\n
\"C<\/p>\n
Palindrome number in c<\/span><\/h2>\n[ad type=”banner”]\n
 
 <\/div> 
#include <stdio.h> main(){   int n, reverse = 0, temp;    printf("Enter a number to check if it is a palindrome or not\\n");   scanf("%d",&n);    temp = n;    while (temp != 0)   {      reverse = reverse * 10;      reverse = reverse + temp%10;      temp    = temp\/10;   }    if (n == reverse)      printf("%d is a palindrome number.\\n", n);   else      printf("%d is not a palindrome number.\\n", n);    return 0;}<\/code><\/pre> <\/div>\n
C program for palindrome without using string functions<\/span><\/h2>\n
 
 <\/div> 
#include <stdio.h>#include <string.h> int main(){   char text[100];   int begin, middle, end, length = 0;    gets(text);    while (text[length] != '\\0')      length++;    end = length - 1;   middle = length\/2;    for (begin = 0; begin < middle; begin++)   {      if (text[begin] != text[end])      {         printf("Not a palindrome.\\n");         break;      }      end--;   }   if (begin == middle)      printf("Palindrome.\\n");    return 0;}<\/code><\/pre> <\/div>\n
C program check palindrome<\/h2>\n[ad type=”banner”]\n
 
 <\/div> 
#include <stdio.h> int is_palindrome(char*);void copy_string(char*, char*);void reverse_string(char*);int string_length(char*);int compare_string(char*, char*); int main(){   char string[100];   int result;    printf("Input a string\\n");   gets(string);    result = is_palindrome(string);    if ( result == 1 )      printf("\\"%s\\" is a palindrome string.\\n", string);   else      printf("\\"%s\\" is not a palindrome string.\\n", string);     return 0;} int is_palindrome(char *string){   int check, length;   char *reverse;    length = string_length(string);       reverse = (char*)malloc(length+1);        copy_string(reverse, string);   reverse_string(reverse);    check = compare_string(string, reverse);    free(reverse);    if ( check == 0 )      return 1;   else      return 0;} int string_length(char *string){   int length = 0;      while(*string)   {      length++;      string++;   }    return length;} void copy_string(char *target, char *source){   while(*source)   {      *target = *source;      source++;      target++;   }   *target = '\\0';} void reverse_string(char *string) {   int length, c;   char *begin, *end, temp;    length = string_length(string);    begin = string;   end = string;    for ( c = 0 ; c < ( length - 1 ) ; c++ )       end++;    for ( c = 0 ; c < length\/2 ; c++ )    {              temp = *end;      *end = *begin;      *begin = temp;       begin++;      end--;   }} int compare_string(char *first, char *second){   while(*first==*second)   {      if ( *first == '\\0' || *second == '\\0' )         break;       first++;      second++;   }   if( *first == '\\0' && *second == '\\0' )      return 0;   else      return -1;}<\/code><\/pre> <\/div>\n
Pointers are used in functions, you can develop your code without using pointers.<\/p>\n","protected":false},"excerpt":{"rendered":"
C program for palindrome – C PRogramming – palindrome program in c language, c code to check if a string is a palindrome or not and for palindrome number. <\/p>\n","protected":false},"author":2,"featured_media":26532,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69866],"tags":[72269,72112,71969,71982,79053,79051,79049,71981,79052,79054,79047,79046,79045,79041,79044,79043,79042,79050,79048],"class_list":["post-26517","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-c-programming","tag-c-program-for-armstrong-number","tag-c-program-for-palindrome","tag-c-program-for-palindrome-number","tag-c-program-for-palindrome-number-using-for-loop","tag-c-program-for-palindrome-number-using-functions","tag-c-program-for-palindrome-or-not","tag-c-program-for-palindrome-string","tag-c-program-for-palindrome-using-for-loop","tag-c-program-for-palindrome-with-explanation","tag-c-program-for-palindrome-word","tag-c-program-to-check-palindrome-number-using-functions","tag-palindrome-program-in-c-using-for-loop","tag-palindrome-program-in-c-with-explanation","tag-palindrome-program-in-c-without-using-string-functions","tag-palindrome-program-in-c","tag-palindrome-string-program-in-c-using-for-loop","tag-program-for-palindrome-in-java","tag-simple-c-program-for-palindrome","tag-write-ac-program-for-palindrome"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26517","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26517"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26517\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media\/26532"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26517"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26517"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26517"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}