Count Set Bits
Clear the lowest 1 with n and (n - 1) until nothing is left, counting rounds.
Bit Manipulation: Count the 1s, Kernighan style
178 and 177 = 176. Subtracting 1 borrows through the trailing zeros, so the AND wipes exactly the lowest 1, at bit 1. That is round 1.
Cost
- Best
- O(1)
- Average
- O(log n)
- Worst
- O(log n)
- Space
- O(1)
Before this
Leads to
Topics that need this one first.
Taught by the same lesson
Bit Manipulation covers these too, in the same run.