This post is completed by 1 user
|Add to List|
Multiply with power of 2 without using pow() or * operator
Objective: Given a number n and k, Calculate n * k2 without using pow() or *operator.
N = 3, k = 4 N*k2 = 48
Approach: Bit Manipulation
Left shift the number N by k.
For example, N = 3 Bit representation: 0 1 1 Left shift by k = 4 0 1 1 0 0 0 0 which is the representation of 48.
Number 3 Multiplied by 2^4 is: 48
Also Read about –
- All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space Hard