dsalgo 0.3.10

A package for Datastructures and Algorithms.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

use crate::find_divisors_trial_division_u64::find_divisors;

// TODO: optimize divisor finding algorithm
pub fn is_perfect_number(n: u64) -> bool {
    find_divisors(n).iter().sum::<u64>() == n << 1
}

#[cfg(test)]

mod tests {

    #[test]

    fn test() {
        use super::*;
        use crate::perfect_numbers::PERFECT_NUMBERS;

        for &n in PERFECT_NUMBERS[..6].iter() {
            assert!(is_perfect_number(n));
        }
    }
}