Fast Power of Two Equal or Larger than a 32-bit Integer
I have seen a naive implementation at work today (written by a colleague). My colleague intends to generate a number that is power of two, and the number is …
Tag: binary operation
Counting the number of Leading Zeros for a 32-bit Integer (Signed or Unsigned)
To count the number of leading zeros for a integer, we can use the following intuitive (bruteforce) method to increment the number of zeros until a first one (from …
Using a Faster Approach to Judge if a Integer is power of Two
Given a signed-integer, we can use the following straightforward method to judge it is the power of two inline bool check1(int i) { if (i < 1) return false; …
A Faster Approach to Count Set Bits in a 32-bit Integer
A bit is set if it is ‘1’. To count how many ‘set’ bits in a 32-bit integer (signed or unsigned), we can use the following straightforward method: inline …