Given two signed integers, write a function that returns true if the signs of given integers are different, otherwise false. For example, the function should return true -1 and +100, and should return false for -100 and -200. The function should not use any of the arithmetic operators.
Let the given integers be x and y. The sign bit is 1 in negative numbers, and 0 in positive numbers. The XOR of x and y will have the sign bit as 1 iff they have opposite sign. In other words, XOR of x and y will be negative number number iff x and y have opposite signs. The following code use this logic.
Signs are opposite
We can also solve this by using two comparison operators. See the following code.
The first method is more efficient. The first method uses a bitwise XOR and a comparison operator. The second method uses two comparison operators and a bitwise XOR operation is more efficient compared to a comparison operation.
We can also use following method. It doesn’t use any comparison operator. The method is suggested by Hongliang and improved by gaurav.
The function is written only for compilers where size of an integer is 32 bit. The expression basically checks sign of (x^y) using bitwise operator ‘>>’. As mentioned above, the sign bit for negative numbers is always 1. The sign bit is the leftmost bit in binary representation. So we need to checks whether the 32th bit (or leftmost bit) of x^y is 1 or not. We do it by right shifting the value of x^y by 31, so that the sign bit becomes the least significant bit. If sign bit is 1, then the value of (x^y)>>31 will be 1, otherwise 0.
Please write comments if you find any of the above codes/algorithms incorrect, or find other ways to solve the same problem.
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Find two integers A and B such that A ^ N = A + N and B ^ N = B + N
- Hamming distance between two Integers
- How to sum two integers without using arithmetic operators in C/C++?
- Check if the XOR of an array of integers is Even or Odd
- Compare two integers without using any Comparison operator
- Smallest of three integers without comparison operators
- Sum of consecutive bit differences of first N non-negative integers
- Bitwise recursive addition of two integers
- Number of integers in a range [L, R] which are divisible by exactly K of it's digits
- Count of integers up to N which represent a Binary number
- Divide two integers without using multiplication, division and mod operator
- Check if given four integers (or sides) make rectangle
- Find maximum XOR of given integer in a stream of integers
- Compute the minimum or maximum of two integers without branching
- Count integers in an Array which are multiples their bits counts
- Queries to find the count of integers in a range that contain the given pattern
- Number of mismatching bits in the binary representation of two integers
- Find the missing element in an array of integers represented in binary format
- Find a number which give minimum sum when XOR with every number of array of integers
- Number of integers with odd number of set bits