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::is_prime_naive::is_prime_naive;

// TODO: accelerate wtih miller rabin.
/// for small n, use prime numbers list and precompute prev/next prime.

pub fn previous_prime_number(mut n: u64) -> u64 {
    assert!(n > 2);

    loop {
        n -= 1;

        if is_prime_naive(n) {
            break;
        }
    }

    n
}

#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}