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

Display Prime Numbers Between Intervals Using Function in C

By -

 

Display Prime Numbers Between Intervals Using Function in C

In this example, you will learn to print all prime numbers between two numbers (entered by the user).

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

  • C for Loop
  • C break and continue
  • C Functions
  • C User-defined functions

To find all the prime numbers between the two integers, checkPrimeNumber() is created. This function checks whether a number is prime or not.

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

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