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
23
24
25
26
27

use crate::prime_factorize_with_least_prime_factor_table_u32::PrimeFactorize;

pub fn prime_factorize_factorial_lpf(n: u32) -> Vec<u32> {
    let size = n as usize + 1;

    let mut count = vec![0; size];

    let lpf = PrimeFactorize::new(size);

    for i in 2..=n as u32 {
        for (p, e) in lpf.factorize(i) {
            count[p as usize] += e;
        }
    }

    count
}

// TODO:
#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}