Bitwise Operation, Add one to a number without using +

Question

Anonymous · Accepted Answer

int add (int n) { return n & 1 ? add (n>>1)<<1 : n | 1; } First expression in the ternary operator is carrying the 1 if the last binary digit is one, the second is adding the 1 if the last binary digit is 0

Anonymous · Answer

-(~x)

To simulate an adder · Answer

#include 
#include 

using namespace std;

int AddOne(int N);

int main()
{
  srand(0);
  int N = 0;
  for (int i=0; i0)
    {
      Temp = (CarryIn & N) & One[bitI++];
      N = (N ^ CarryIn);
      CarryIn = Temp << 1;
    }
    return N;
}
Ironically, although the "+" is not applied to the number, the iteration index is incremented.

Two Sigma

Two Sigma interview question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches