Scribd Logo
Upload

Welcome to Scribd!

  • Data Structur

    Uploaded by

    shilpashree
    17 views1 page
    This document contains code to check if a string is a palindrome. It takes a string as input, reverses it, and compares the original and reversed strings. If they are equal, it is a palindrome. The code uses recursion to reverse the string by calling the palin function with incrementing and decrementing index parameters.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains code to check if a string is a palindrome. It takes a string as input, reverses it, and compares the original and reversed strings. If they are equal, it is a palindrome. The code uses recursion to reverse the string by calling the palin function with incrementing and decrementing index parameters.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    17 views1 page

    Data Structur

    Uploaded by

    shilpashree
    This document contains code to check if a string is a palindrome. It takes a string as input, reverses it, and compares the original and reversed strings. If they are equal, it is a palindrome. The code uses recursion to reverse the string by calling the palin function with incrementing and decrementing index parameters.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 1

    Check whether given string is palindrome or not

    #include < stdio.h > #include < conio.h > int palin(char str[],int i,int j); void main() { char str[100]; int i,j,reply; clrscr(); printf("\nEnter a string \n"); gets(str); //... locate last character j = 0; while ( str[j] != '\0') { j++; } // while j--; i=0; reply = palin(str,i,j); if( reply == 0 ) printf("\n %s is not palindrome",str); else printf("\n %s is palindrome",str); }//main int palin(char str[],int i,int j) { if (i < j ) { if ( str[i] != str[j]) return(0); else return(palin(str,i+1,j-1)); } else return(1); } // main

    Find the divisors of a number


    #include < stdio.h > #include < conio.h > void main() { int n,d; clrscr(); printf("\n Enter n : "); scanf("%d",&n); printf("\n The divisors of %d are\n",n); d = 1; while ( d<= n/2) { if ( n % d == 0 ) { printf("\n%d",d); } d++; } // whi;e } // main

    You might also like