C Program : Factorial Program using Recursion
#include<stdio.h>
printf("Enter a number: ");
scanf("%d", &number);
fact = factorial(number);
printf("Factorial of %d is %ld\n", number, fact);
long factorial(int n) {
if (n == 0)
return 1;
else
return(n * factorial(n-1));
return 1;
else
return(n * factorial(n-1));
}
void main(){
int number;
long fact;
printf("Enter a number: ");
scanf("%d", &number);
fact = factorial(number);
printf("Factorial of %d is %ld\n", number, fact);
return 0;
}
}
Output:
Enter a number: 6
Factorial of 5 is: 720
C Program : Palindrome
Let's see the palindrome program in C. In this c program, we will get an input from the user and check whether number is palindrome or not.
int main(){
int n,r,sum=0,temp;
printf("enter the number=");
scanf("%d",&n);
temp=n;
printf("enter the number=");
scanf("%d",&n);
temp=n;
while(n>0){
r=n%10;
sum=(sum*10)+r;
n=n/10;
}
sum=(sum*10)+r;
n=n/10;
}
if(temp==sum)
printf("palindrome number ");
printf("palindrome number ");
else
printf("not palindrome");
printf("not palindrome");
return 0;
}
}
Output:
enter the number=151 palindrome number
enter the number=5621 not palindrome number
C Program : Prime Number
#include
int main(){
int n,i,m=0,flag=0;
printf("Enter the number to check prime:");
scanf("%d",&n);
m=n/2;
for(i=2;i<=m;i++){
if(n%i==0){
printf("Number is not prime");
flag=1;
break;
}
}
}
}
if(flag==0)
printf("Number is prime");
return 0;
}
}
Output:
Enter the number to check prime:56 Number is not prime
Enter the number to check prime:23 Number is prime
C Program : Fibonacci Series using Recursion
#include
void printFibonacci(int n){
static int n1=0,n2=1,n3;
if(n>0){
n3 = n1 + n2;
n1 = n2;
n2 = n3;
printf("%d ",n3);
printFibonacci(n-1);
}
}
int main(){
int n;
printf("Enter the number of elements: ");
scanf("%d",&n);
printf("Fibonacci Series: ");
printf("%d %d ",0,1);
printFibonacci(n-2);//n-2 because 2 numbers are already printed
return 0;
}
Output:
Enter the number of elements:15 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
C Program : Fibonacci Series without Recursion
#include
void main(){
int n1=0,n2=1,n3,i,number;
clrscr();
printf("Enter the number of elements:");
scanf("%d",&number);
printf("\n%d %d",n1,n2);//printing 0 and 1
for(i=2; i<number; ++i){
n3=n1+n2;
printf(" %d",n3);
n1=n2;
n2=n3;
}
getch();
}
Output:
Enter the number of elements:15
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
Latest YouTube Channel to learn from
BIRAJ IAS - YOUTUBE CHANNEL
This YouTube Channel is related to studies for the topics like IAS, PCS, SSC Exam Preparation.
So if you want to learn something good than don't forget to go through this channel once.
Guest Blogging
We are happy to announce that we are welcoming guest bloggers from different fields.
This is the great opportunity to show your writing passion to the world. So we just started guest blogging on our blog. Anyone interested can contact us through our email so that we can introduce him/her to our readers.
A Huge applause for our guest bloggers.
Welcome to Yaar No Technology Family!
Welcome to Yaar No Technology Family!
Contact : gupta024.10.1997@gmail.com
Started an eCommerce Company in India
Subject to CopyRight |
The story behind it is very long and an impressive in my points of view. It can be differed from person to person. The motive behind this eCommerce startup is the competency and the coming future of Retail Trade in India. Just by seeing the future and motivation to do something great in this field will fulfill me with great enthusiasm. As I always wanted to do something great in my life.
So after doing long & enough research in this field I started out the company called SWALK RETAIL PRIVATE LIMITED. But got the brand name CyberKart.
After doing research for many days and months I came to the point for finally starting up of the company. This will provide service all over India and will help sellers from small cities and town to increase the reach of their business by providing them great services.
Will help the people of Rural to understand and learn the working of such businesses.For Business related queries Contact Us @ gupta024.10.1997@gmail.com
Subscribe to:
Posts (Atom)