Swap two numbers without using third variable

SWAPPING TWO NUMBERS WITHOUT USING A THIRD VARIABLE

There are two common ways to swap two numbers without using a third variable:

PROGRAM 1 (Using addition and Subtraction):

#include <stdio.h>

int main()

{

    int a,b;

    printf("enter the value of a: ");

    scanf("%d",&a);

    printf("enter the value of b: ");

    scanf("%d",&b);

    printf("Before swapping, a=%d b=%d.",a,b);

    a=a+b;

    b=a-b;

    a=a-b;

    printf("\nAfter swapping, a=%d b=%d.",a,b);

    return 0;

}




PROGRAM 2 (Using Bitwise XOR):

#include <stdio.h>

int main()
{

    int a,b;

    printf("enter the value of a: ");

    scanf("%d",&a);

    printf("enter the value of b: ");

    scanf("%d",&b);

    printf("Before swapping, a=%d b=%d.",a,b);

    a=a^b;

    b=a^b;

    a=a^b;

    printf("\nAfter swapping, a=%d b=%d.",a,b);

    return 0;

}




TIME COMPLEXITY:

The time complexity is O(1) because the code performs a fixed number of operations  regardless of the size of the input. This means the time taken to execute the code remains constant, even if the input values increase.


SPACE COMPLEXITY:

The space complexity is O(1) because only a constant amount of extra space is used to store the variables a and b. The space usage does not grow with the size of the input, so it remains constant.


Comments

Post a Comment

Popular posts from this blog

Program to check Prime number or not

Image
PRIME NUMBER: A prime number is a positive integer that is divisible only by itself and 1. In other words, it is a number that is not divisible by any other number except for 1 and itself. For example, 2, 3, 5, 7, 11, and 13 are all prime numbers. PROGRAM (METHOD 1):  #include <stdio.h> int main() {     int i,n,flag=0;     printf("Enter a number:");     scanf("%d",&n);     for(i=2;i<n;i++)     if(n%i==0)     flag++;     if(flag==0)     printf("%d is a prime number",n);     else     printf("%d is not a prime number",n);     return 0; } TIME COMPLEXITY: The time complexity is O(n) because the for loop iterates from 2 to n-1, and the number of iterations grows linearly with the input size n. SPACE COMPLEXITY: The program uses a constant amount of extra space to store the variables i and n, which doesn't depend on the size of the input. Therefore, the space complex...
Read more

Program to Reverse a Number

Image
REVERSE A NUMBER: This program takes an integer input from the user, reverses it, and then prints the reversed number. For example, if the user enters 123, the program will print 321. PROGRAM:   #include <stdio.h> #include <string.h> int main() {     int n,rem,rev=0;     printf("Enter a number: ");     scanf("%d",&n);     while(n!=0)     {         rem=n%10;         rev=rev*10+rem;         n=n/10;     }     printf("Reverse of the number is: %d",rev); } TIME COMPLEXITY: The time complexity is indeed O(log n) because the while loop iterates through each digit in the input number, and the number of digits is proportional to the logarithm of the number.  SPACE COMPLEXITY: The program uses a constant amount of extra space to store the variables rem, rev, and n, which doesn't depend on the size of the input number. Therefore, the space comp...
Read more