Course
Introduction
C "Hello, World!" ProgramPrint an Integer (Entered by the User)Add Two IntegersMultiply Two Floating-Point NumbersFind ASCII Value of a CharacterCompute Quotient and RemainderFind the Size of int, float, double and charSwap Two NumbersDecision Making and Loops
Check Whether a Number is Even or OddCheck Whether a Character is a Vowel or ConsonantFind the Largest Number Among Three NumbersFind the Roots of a Quadratic EquationCheck Leap YearCheck Whether a Number is Positive or NegativeCheck Whether a Character is an Alphabet or notCalculate the Sum of Natural NumbersFind Factorial of a NumberGenerate Multiplication TableDisplay Fibonacci SequenceFind GCD of two NumbersFind LCM of two NumbersDisplay Characters from A to Z Using LoopCount Number of Digits in an IntegerReverse a NumberCalculate the Power of a NumberCheck Whether a Number is Palindrome or NotCheck Whether a Number is Prime or NotDisplay Prime Numbers Between Two IntervalsCheck Armstrong NumberDisplay Armstrong Number Between Two IntervalsDisplay Factors of a NumberMake a Simple Calculator Using switch...casePrint Pyramids and PatternsFunctions
Demonstrate the Working of Keyword longDisplay Prime Numbers Between Intervals Using FunctionCheck Prime or Armstrong Number Using User-defined FunctionCheck Whether a Number can be Expressed as Sum of Two Prime NumbersFind the Sum of Natural Numbers using RecursionFind Factorial of a Number Using RecursionFind G.C.D Using RecursionConvert Binary Number to Decimal and vice-versaConvert Octal Number to Decimal and vice-versaConvert Binary Number to Octal and vice-versaReverse a Sentence Using Recursioncalculate the power using recursionArrays and Pointers
Calculate Average Using ArraysFind Largest Element in an ArrayCalculate Standard DeviationAdd Two Matrices Using Multi-dimensional ArraysMultiply Two Matrices Using Multi-dimensional ArraysFind Transpose of a MatrixMultiply two Matrices by Passing Matrix to a FunctionAccess Array Elements Using PointerC Program Swap Numbers in Cyclic Order Using Call by ReferenceFind Largest Number Using Dynamic Memory AllocationStrings
Find the Frequency of Characters in a StringCount the Number of Vowels, Consonants and so onRemove all Characters in a String Except AlphabetsFind the Length of a StringConcatenate Two StringsCopy String Without Using strcpy()Sort Elements in Lexicographical Order (Dictionary Order)Structures and Unions
Store Information of a Student Using StructureAdd Two Distances (in inch-feet system) using StructuresAdd Two Complex Numbers by Passing Structure to a FunctionCalculate Difference Between Two Time PeriodsStore Information of Students Using StructureStore Data in Structures DynamicallyC Program to Check Prime or Armstrong Number Using User-defined Function
To understand this example, you should have the knowledge of the following C programming topics:
- C for Loop
- C while and do…while Loop
- C break and continue
- C Functions
- Types of User-defined Functions in C Programming
Visit these pages to learn to check whether a number is
Example: Check Prime and Armstrong
#include <math.h>
#include <stdio.h>
int checkPrimeNumber(int n);
int checkArmstrongNumber(int n);
int main() {
int n, flag;
printf("Enter a positive integer: ");
scanf("%d", &n);
// check prime number
flag = checkPrimeNumber(n);
if (flag == 1)
printf("%d is a prime number.\n", n);
else
printf("%d is not a prime number.\n", n);
// check Armstrong number
flag = checkArmstrongNumber(n);
if (flag == 1)
printf("%d is an Armstrong number.", n);
else
printf("%d is not an Armstrong number.", n);
return 0;
}
// function to check prime number
int checkPrimeNumber(int n) {
int i, flag = 1, squareRoot;
// computing the square root
squareRoot = sqrt(n);
for (i = 2; i <= squareRoot; ++i) {
// condition for non-prime number
if (n % i == 0) {
flag = 0;
break;
}
}
return flag;
}
// function to check Armstrong number
int checkArmstrongNumber(int num) {
int originalNum, remainder, n = 0, flag;
double result = 0.0;
// store the number of digits of num in n
for (originalNum = num; originalNum != 0; ++n) {
originalNum /= 10;
}
for (originalNum = num; originalNum != 0; originalNum /= 10) {
remainder = originalNum % 10;
// store the sum of the power of individual digits in result
result += pow(remainder, n);
}
// condition for Armstrong number
if (round(result) == num)
flag = 1;
else
flag = 0;
return flag;
}
Output
Enter a positive integer: 407
407 is not a prime number.
407 is an Armstrong number.
In this program, two user-defined functions checkPrimeNumber()
and checkArmstrongNumber()
are created.
The checkPrimeNumber()
function returns:
1
if the number entered by the user is a prime number.0
if the number entered by the user is not a prime number.
Similarly, checkArmstrongNumber()
function returns:
1
if the number entered by the user is an Armstrong number.0
if the number entered by the user is not an Armstrong number.
Note: In checkPrimeNumber()
and checkArmstrongNumber()
functions, the flag variables are the return value of the functions.
In main()
, the flag variable stores the values returned by checkPrimeNumber()
and checkArmstrongNumber()
.