feat: add binary count trailing zeros algorithm #972
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Description
Adds an algorithm to count trailing zeros in the binary representation of a number.
Algorithm
Counts the number of consecutive zeros from the least significant bit (rightmost) in the binary representation of an unsigned integer.
Time Complexity: O(1) - uses CPU instruction
Space Complexity: O(1)
Example
Implementation Details
trailing_zeros()methodlog2(num & -num)tricku64for compile-time guaranteesTesting
Checklist