Log in to add a comment

Log in to add a comment

---------------------------------

#include

int 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;

}

/*Taking reverse of the given no see reverse no program*/

if (n == reverse)

/* if reverse is same as n*/

printf("%d is a palindrome number. \n", n);

else

printf(" %d is not a palindrome number. \n",n);

return 0;

}

------------------

output:

-------------------

Enter a number to check if it is a palindrome or not

12321

12321 is a palindrome number.

------------------

=======================

-------------------------------------

Fibonacci series using loop:

--------------------------------------

#include

int main ( )

{

int n, first =0, second =1, next, c;

printf("Enter the number of terms\n");

scanf("%d",&n);

printf("First %d terms of Fibonacci series are:-\n",n);

for (c=0;c{

if(c <= 1)

next=c;

else

{

next =first+second;

first=second;

second=next;

/*replaced first no by second & second by addition of first & second by addition of first & second*/

}

printf("%d\n",next);

}

return 0;

}

=======================

-----------------------------------

Fibonacci series using recursion :

-----------------------------------

#include

int Fibonacci (int);

main ( )

{

int n, I =0, c;

printf("Enter the number of terms");

scanf("%d",&n);

printf("First %d terms of Fibonacci series are:- \n",n);

for (c=1; c{

printf ("%d\n",Fibonacci (I));

I++;

}

return 0;

}

int Fibonacci (int n)

{

if (n == 0)

return 0;

else if ( n==1 )

return 1;

else

return ( Fibonacci(n-1)+Fibonacci(n-2) );

/*adding Fibonacci of (n-1) & (n-2) by recursive calling it*/

}

-----------------

output:

------------------

Enter the number of terms

5

First 5 terms of Fibonacci series are:-

0

1

1

2

3

=======================