The Algorithms logo
The Algorithms
AboutDonate

Kerninghan

A
I
pub fn kerninghan(n: u32) -> i32 {
    let mut count = 0;
    let mut n = n;

    while n > 0 {
        n = n & (n - 1);
        count += 1;
    }

    count
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn count_set_bits() {
        assert_eq!(kerninghan(0b0000_0000_0000_0000_0000_0000_0000_1011), 3);
        assert_eq!(kerninghan(0b0000_0000_0000_0000_0000_0000_1000_0000), 1);
        assert_eq!(kerninghan(0b1111_1111_1111_1111_1111_1111_1111_1101), 31);
    }
}