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

assert_eq!(binary_count_trailing_zeros(25),0);// 11001 -> 0 trailing zerosassert_eq!(binary_count_trailing_zeros(36),2);// 100100 -> 2 trailing zerosassert_eq!(binary_count_trailing_zeros(16),4);// 10000 -> 4 trailing zerosassert_eq!(binary_count_trailing_zeros(58),1);// 111010 -> 1 trailing zero

Implementation Details

• Primary: Uses Rust's built-intrailing_zeros() method
• Alternative: Bitwise implementation usinglog2(num & -num) trick
• Compiles to single CPU instruction (BSF/TZCNT on x86)
• Handles zero case explicitly to return 0
• Type-safe: usesu64 for compile-time guarantees

Testing

• All existing tests pass
• Added test suite covering:
  • Basic cases from Python examples
  • Zero handling
  • Powers of 2
  • Comprehensive bitwise vs built-in comparison (22 test cases)

Checklist

• Code follows the repository's style guidelines
• Self-review performed
• Code is well-commented
• Tests added and passing
• Documentation added