x

Choose Country Code

x

Direction

x

Ask a Question

  • Ask a Question
  • Scan a Question
  • Post MCQ
  • Note: File extension must be of jpg, jpeg, png, bmp format and file size must not exceed 5 MB
x

Ask a Question

x

x
x
x
Hire a Tutor

Answers and Solutions

What's Your Question?
Answer

#include<stdio.h>

int Add(int x, int y)

{

    // Iterate till there is no carry 

    while (y != 0)

    {

        // carry now contains common set bits of x and y

        int carry = x & y; 

        // Sum of bits of x and y where at least one of the bits is not set

        x = x ^ y;

 

        // Carry is shifted by one so that adding it to x gives the required sum

        y = carry << 1;

    }

    return x;

}

 

int main()

{

    printf("%d", Add(15, 32));

    return 0;

}

Post Answer and Earn Credit Points

Get 5 credit points for each correct answer. The best one gets 25 in all.

Post Answer