Advertisement
apl-mhd

palindromeUsingRecursion

Dec 18th, 2016
128
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.79 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4.  
  5. int last;
  6.  
  7. int palindrome(char *p, int start, int end){
  8.  
  9.  
  10.     if(end == start)
  11.         return;
  12.     if(p[start] != p[end]){
  13.  
  14.  
  15.         return -1;
  16.     }
  17.  
  18.     palindrome(p, start+1, end-1); /*recursively call*/
  19.  
  20.     return 0;
  21. }
  22.  
  23.  
  24. int main()
  25. {
  26.  
  27.    char name[100];
  28.  
  29.    char *p;
  30.  
  31.     int end, start, check;
  32.  
  33.     printf("Enter Word\n");
  34.     gets(name);
  35.     start =0;
  36.     end = strlen(name)-1; /*string length*/
  37.  
  38.  
  39.     p = name; /*assign string to pointer*/
  40.  
  41.    check = palindrome(p, start, end); /*function call*/
  42.  
  43.      //printf("%d %d\n",check,end);
  44.         if(check == -1){
  45.             printf(" not palindrom\n");
  46.         }
  47.  
  48.         else {
  49.  
  50.             printf("palindrom\n");
  51.         }
  52.  
  53.     return 0;
  54. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement