The task is to divide a number by 7 efficiently without using {/, *, -} operators.
Possible Solution:
The solution is to realize that we can do thi ...
Search results for bitwise
Possible Solution:
int Zerros(int Number)
{
int count = 0;
while (((Number & 1) == 0) && (Number !=0))
{
count++;
Number >>= 1;
}
ret ...
Possible Solution:
Bitwise operations are very efficient and unexpressive, and doubling a number is a simple shift to the left i.e adding a zero on ...
Another very common question is to count number of set bits in a given number.
Solution in C#
int Count(int Number)
{
int count = 0;
while (Number ...
Write a function bool isEven(int Number) which would check if input number is even or odd.
Solution:
The key to this question is to understand tha ...
Answer:
int Double(int Number)
{
return (Number >> 1);
}
Note that the fractional part is rounded down.
...
« previous1 next »