Compute n modulo d without division(/) and modulo(%) operators, where d is a power of 2 number.
Let ith bit from right is set in d. For getting n modulus d, we just need to return 0 to i-1 (from right) bits of n as they are and other bits as 0.
For example if n = 6 (00..110) and d = 4(00..100). Last set bit in d is at position 3 (from right side). So we need to return last two bits of n as they are and other bits as 0, i.e., 00..010.
Now doing it is so easy, guess it….
Yes, you have guessing it right. See the below program.
Please write comments if you find any bug in the above program/algorithm or other ways to solve the same problem.
- Compute the minimum or maximum of two integers without branching
- Compute the integer absolute value (abs) without branching
- Optimization Techniques | Set 1 (Modulus)
- Calculate 7n/8 without using division and multiplication operators
- Cyclic Redundancy Check and Modulo-2 Division
- Compute the parity of a number using XOR and table look-up
- Divide two integers without using multiplication, division and mod operator
- Fast average of two numbers without division
- Check a number is odd or even without modulus operator
- Subset Sum Queries in a Range using Bitset
- Range and Update Sum Queries with Factorial
- Range Sum Queries and Update with Square Root
- Sum of Bitwise-OR of all subarrays of a given Array | Set 2
- Distance between two nodes of binary tree with node values from 1 to N
Improved By : vt_m