Swap Two Numbers in C

By -
  Swap Two Numbers in C In this example, you will learn to swap two numbers in C programming using two different techniques. To understand this example, you should have the knowledge of the following C programming topics: C Data Types C Programming Operators C Input Output (I/O) Swap Numbers Using Temporary Variable # include <stdio.h> int main () { double first, second, temp; printf ( "Enter first number: " ); scanf ( "%lf" , &first); printf ( "Enter second number: " ); scanf ( "%lf" , &second); // Value of first is assigned to temp temp = first; // Value of second is assigned to first first = second; // Value of temp (initial value of first) is assigned to second second = temp; printf ( "\nAfter swapping, firstNumber = %.2lf\n" , first); printf ( "After swapping, secondNumber = %.2lf" , second); return 0 ; } Output ...
Post a Comment

Find G.C.D Using Recursion in C

By -

 

Find G.C.D Using Recursion in C

In this example, you will learn to find the GCD (Greatest Common Divisor) of two positive integers entered by the user using recursion.

To understand this example, you should have the knowledge of the following C programming topics:

  • C Functions
  • C User-defined functions
  • C Recursion

This program takes two positive integers as input from the user and calculates GCD using recursion.

Visit this page to learn how you can calculate the GCD using loops.

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.

In this program, recursive calls are made until the value of n2 is equal to 0.

Comments

Post a Comment

Popular posts from this blog

Find GCD of two Numbers in C

By -
  Find GCD of two Numbers in C Examples on different ways to calculate GCD of two integers (for both positive and negative integers) using loops and decision making statements. To understand this example, you should have the knowledge of the following C programming topics: C Programming Operators C for Loop C if...else Statement C while and do...while Loop The HCF or GCD of two integers is the largest integer that can exactly divide both numbers (without a remainder). There are many ways to find the greatest common divisor in C programming. Example #1: GCD Using for loop and if Statement # include <stdio.h> int main () { int n1, n2, i, gcd; printf ( "Enter two integers: " ); scanf ( "%d %d" , &n1, &n2); for (i= 1 ; i <= n1 && i <= n2; ++i) { // Checks if i is factor of both integers if (n1%i== 0 && n2%i== 0 ) gcd = i; } printf ( "G.C.D of %d and %d is %d" ...
Read more

Swap Two Numbers in C

By -
  Swap Two Numbers in C In this example, you will learn to swap two numbers in C programming using two different techniques. To understand this example, you should have the knowledge of the following C programming topics: C Data Types C Programming Operators C Input Output (I/O) Swap Numbers Using Temporary Variable # include <stdio.h> int main () { double first, second, temp; printf ( "Enter first number: " ); scanf ( "%lf" , &first); printf ( "Enter second number: " ); scanf ( "%lf" , &second); // Value of first is assigned to temp temp = first; // Value of second is assigned to first first = second; // Value of temp (initial value of first) is assigned to second second = temp; printf ( "\nAfter swapping, firstNumber = %.2lf\n" , first); printf ( "After swapping, secondNumber = %.2lf" , second); return 0 ; } Output ...
Read more