Find Minimum element in array without shorted
public static void Find_Min_Value(int [] arr,int n) { int min=arr[0]; for(int i=0;i<n;i++) { if(arr[i]<min) ...
Post Top Ad
Wednesday 27 May 2020
Calculate total sum of Array element
public static int SumOfarray(int []arr,int n) { int sum=arr[0]; for(int i=1;i<n;i++) { sum=sum+arr[i]; } ...
Monday 10 February 2020
COMBINATION OF FIBONACCI AND PRIME NUMBER SERISE
#include<stdio.h> //NO IS PRIME OR NOT int Isprime(int no) { int i; for(i=2;i<=no/2;i++) { if(no%i==0) return 0...
Write a Program tTo Print Fibonacci Serise To Given Range A To B
#include<stdio.h> #include<conio.h> void Fibonacci(int x,int y) { int i,a=0,b=1,c; while(a<=y) { if(a&...
Sunday 9 February 2020
Display Fibonacci Serise Upto N
#include<stdio.h> #include<conio.h> void Fibonacci(int n) { int i,a=0,b=1,c; printf("%d",b); for(i=1;i<...
Print Strong Nuber From A To B
#include<stdio.h> #include<conio.h> // Factorial of ANy Number int fact(int no) { int i,res=1; for(i=no;i>0;i--) ...
Strong Number Checker Program
#include<stdio.h> #include<conio.h> // Factorial of ANy Number int fact(int no) { int i,res=1; for(i=no;i>0;i--) ...
Write A Program To Find Factorial OF ANY Number
#include<stdio.h> #include<conio.h> int fact(int no) { int i,res=1; for(i=no;i>0;i--) { res=i*res; } retu...
Display Nth Perfect number
#include<stdio.h> #include<conio.h> // Check perfect no por not int IsPerfect(int no) { int i,res=0; for(i=1;i<=no...
Display All Perfect Number From A to B
#include<stdio.h> #include<conio.h> // Check perfect no por not int IsPerfect(int no) { int i,res=0; for(i=1;i<=no...
Display All Perfect Number Up To N
#include<stdio.h> #include<conio.h> // Check perfect no por not int IsPerfect(int no) { int i,res=0; for(i=1;i<=no...
Write A Program To check Perfect NO OR NOT
#include<stdio.h> #include<conio.h> int IsPerfact(int no) { int i,res=0; for(i=1;i<=no/2;i++) { if(no%i==0) ...
Program To Print nth Armstrong Number
#include<stdio.h> #include<conio.h > // Digit count LOGIC int NofDig(int no) { int i,res=0; for(i=0;no;i++) {...
Display Armstrong NUmbers From N Onwards
#include<stdio.h> #include<conio.h > // Digit count LOGIC int NofDig(int no) { int i,res=0; for(i=0;no;i++) {...
Display Armstrong Numbers In a Range OF A To B
#include<stdio.h> #include<conio.h > // Digit count LOGIC int NofDig(int no) { int i,res=0; for(i=0;no;i++) {...
Program To display First N Armstrong Number
#include<stdio.h> #include<conio.h > // Digit count LOGIC int NofDig(int no) { int i,res=0; for(i=0;no;i++) ...
Program To Display N Armstrong NUmber
#include<stdio.h> #include<conio.h > // Digit count LOGIC int NofDig(int no) { int i,res=0; for(i=0;no;i++) ...
Write A Program To Check Program is Armstrong Or NOT
#include<stdio.h> #include<conio.h > // Digit count LOGIC int NofDig(int no) { int i,res=0; for(i=0;no;i++) ...
Write A Function Power OF Any Number
int Power(int x,int y) { int i,p=1; for(i=1;i<=y;i++) { p=p*x; } return p; }
Write A Program To Count number OF DIGIT
#include<stdio.h> #include<conio.h > // Digit count LOGIC int NofDig(int no) { int i,res=0; for(i=0;no;i++) ...
Display Nth Prime Number
#include<stdio.h> #include<conio.h> // NO IS PRIME OR NOT int Isprime(int no) { int i; for(i=2;i<=no/2;i++) { ...
Display Nth Pelindrome Number
#include<stdio.h> #include<conio.h> int RevNo(int no) { int i,res=0; for(i=no;no;i++) { res=res*10+no%1...
Display All Pelindrome Number From N Onward
#include<stdio.h> #include<conio.h> int RevNo(int no) { int i,res=0; for(i=no;no;i++) { res=res*10+no%...
Write A Program Display Pelindrome Number bettween A To B
#include<stdio.h> #include<conio.h> int RevNo(int no) { int i,res=0; for(i=no;no;i++) { res=res*10+no%...
Write a Program display First N Pelindrome Numbers
#include<stdio.h> #include<conio.h> int RevNo(int no) { int i,res=0; for(i=no;no;i++) { res=res*10+no%1...
