programming knowledge

  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: 3 Enter power number(positive integer): 4 3^4 = 81

  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: margorp emosewa awesome program

  Example 1: Program to Convert Decimal to Octal # include <stdio.h> # include <math.h> int convertDecimalToOctal ( int decimalNumber) ; int main () { int decimalNumber; printf ( "Enter a decimal number: " ); scanf ( "%d" , &decimalNumber); printf ( "%d in decimal = %d in octal" , decimalNumber, convertDecimalToOctal(decimalNumber)); return 0 ; } int convertDecimalToOctal ( int decimalNumber) { int octalNumber = 0 , i = 1 ; while (decimalNumber != 0 ) { octalNumber += (decimalNumber % 8 ) * i; decimalNumber /= 8 ; i *= 10 ; } return octalNumber; } Output Enter a decimal number: 78 78 in decimal = 116 in octal Example 2: Program to Convert Octal to Decimal # include <stdio.h> # include <math.h> long long convertOctalToDecimal ( int octalNumber) ; int main () { int octalNumber; printf ( "Enter an octal number: " ); ...

  Program to convert binary to decimal # include <math.h> # include <stdio.h> int convert ( long long n) ; int main () { long long n; printf ( "Enter a binary number: " ); scanf ( "%lld" , &n); printf ( "%lld in binary = %d in decimal" , n, convert(n)); return 0 ; } int convert ( long long n) { int dec = 0 , i = 0 , rem; while (n != 0 ) { rem = n % 10 ; n /= 10 ; dec += rem * pow ( 2 , i); ++i; } return dec; } Output Enter a binary number: 110110111 110110111 in binary = 439 Program to convert decimal to binary # include <math.h> # include <stdio.h> long long convert ( int n) ; int main () { int n; printf ( "Enter a decimal number: " ); scanf ( "%d" , &n); printf ( "%d in decimal = %lld in binary" , n, convert(n)); return 0 ; } long long convert ( int n) { long long b...

  GCD of Two Numbers using Recursion # include <stdio.h> int hcf ( int n1, int n2) ; int main () { int n1, n2; printf ( "Enter two positive integers: " ); scanf ( "%d %d" , &n1, &n2); printf ( "G.C.D of %d and %d is %d." , n1, n2, hcf(n1, n2)); return 0 ; } int hcf ( int n1, int n2) { if (n2 != 0 ) return hcf(n2, n1 % n2); else return n1; } Output Enter two positive integers: 366 60 G.C.D of 366 and 60 is 6.

  Factorial of a Number Using Recursion # include <stdio.h> long int multiplyNumbers ( int n) ; int main () { int n; printf ( "Enter a positive integer: " ); scanf ( "%d" ,&n); printf ( "Factorial of %d = %ld" , n, multiplyNumbers(n)); return 0 ; } long int multiplyNumbers ( int n) { if (n>= 1 ) return n*multiplyNumbers(n -1 ); else return 1 ; } Output Enter a positive integer: 6 Factorial of 6 = 720

  Sum of Natural Numbers Using Recursion # include <stdio.h> int addNumbers ( int n) ; int main () { int num; printf ( "Enter a positive integer: " ); scanf ( "%d" , &num); printf ( "Sum = %d" , addNumbers(num)); return 0 ; } int addNumbers ( int n) { if (n != 0 ) return n + addNumbers(n - 1 ); else return n; } Output Enter a positive integer: 20 Sum = 210

  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 ; for (i = 2 ; i <= n / 2 ; ++i) { if (n % i == 0 ) { isPrime = 0 ; break ; } } return isPrime; } Output Enter a positive integer: 34 34 = 3...

  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 ==...

  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); 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: 12 30 Prime numbers between 12 and 30 are: 13 17 19 23 29