Scribd
Upload
5 views

functions programs

The document contains multiple C programming examples demonstrating various functionalities such as finding prime numbers between two integers, checking if a number is prime or an Armstrong number, expressing an integer as the sum of two prime numbers, calculating power using recursion, and reversing a sentence using recursion. Each example includes code snippets and sample outputs for user inputs. The programs utilize functions for specific tasks, enhancing modularity and readability.

Uploaded by

mamatha.pragada
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views

functions programs

The document contains multiple C programming examples demonstrating various functionalities such as finding prime numbers between two integers, checking if a number is prime or an Armstrong number, expressing an integer as the sum of two prime numbers, calculating power using recursion, and reversing a sentence using recursion. Each example includes code snippets and sample outputs for user inputs. The programs utilize functions for specific tasks, enhancing modularity and readability.

Uploaded by

mamatha.pragada
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

1.

Prime Numbers Between Two Integers


#include <stdio.h>
int checkPrimeNumber(int n);
int main()
{
int n1, n2, i, flag;
printf("Enter two positive integers: ");
scanf("%d %d", &n1, &n2);
// swap n1 and n2 if n1 > n2
if (n1 > n2) {
n1 = n1 + n2;
n2 = n1 - n2;
n1 = n1 - n2;
}
printf("Prime numbers between %d and %d are: ", n1, n2);
for (i = n1 + 1; i < n2; ++i) {
// flag will be equal to 1 if i is prime
flag = checkPrimeNumber(i);
if (flag == 1) {
printf("%d ", i);
}
}
return 0;
}
// user-defined function to check prime number
int checkPrimeNumber(int n) {
int j, flag = 1;
for (j = 2; j <= n / 2; ++j) {
if (n % j == 0) {
flag = 0;
break;
}
}
return flag;
}

Output:-
Enter two positive integers: 5
10
Prime numbers between 5 and 10 are: 7

2. Example: Check Prime and Armstrong function


#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;
}

Out put
Enter a positive integer: 371
371 is not a prime number.
371 is an Armstrong number.

3. Integer as a Sum of Two Prime Numbers


#include <stdio.h>
int checkPrime(int n);
int main()
{
int n, i, flag = 0;
printf("Enter a positive integer: ");
scanf("%d", &n);
for (i = 2; i <= n / 2; ++i)
{
// condition for i to be a prime number
if (checkPrime(i) == 1)
{
// condition for n-i to be a prime number
if (checkPrime(n - i) == 1)
{
printf("%d = %d + %d\n", n, i, n - i);
flag = 1;
}
}
}

if (flag == 0)
printf("%d cannot be expressed as the sum of two prime numbers.", n);

return 0;
}
// function to check prime number
int checkPrime(int n)
{
int i, isPrime = 1;

// 0 and 1 are not prime numbers


if (n == 0 || n == 1)
{
isPrime = 0;
}
else {
for(i = 2; i <= n/2; ++i)
{
if(n % i == 0) {
isPrime = 0;
break;
}
}
}
return isPrime;
}

Output
Enter a positive integer: 28
28 = 5 + 23
28 = 11 + 17

4. Program to calculate power using recursion


#include <stdio.h>
int power(int n1, int n2);
int main()
{
int base, a, result;
printf("Enter base number: ");
scanf("%d", &base);
printf("Enter power number(positive integer): ");
scanf("%d", &a);
result = power(base, a);
printf("%d^%d = %d", base, a, result);
return 0;
}
int power(int base, int a)
{
if (a != 0)
return (base * power(base, a - 1));
else
return 1;
}

OUTPUT
Enter base number: 5
Enter power number(positive integer): 5
5^5 = 3125

5. Reverse a sentence using recursion


#include <stdio.h>
void reverseSentence();
int main()
{
printf("Enter a sentence: ");
reverseSentence();
return 0;
}

void reverseSentence() {
char c;
scanf("%c", &c);
if (c != '\n') {
reverseSentence();
printf("%c", c);
}
}
Output
Enter a sentence: aveshgopal
lapoghseva

You might also like