algorithms-edu 0.1.1

Algorithms for pedagogical demonstration
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

use super::gcd::{gcd, gcd_unsigned};
use num_traits::{Signed, Unsigned};

pub fn lcm<T: Signed + Copy>(a: T, b: T) -> T {
    ((a / gcd(a, b)) * b).abs()
}
pub fn lcm_unsigned<T: Unsigned + Copy>(a: T, b: T) -> T {
    (a / gcd_unsigned(a, b)) * b
}

#[cfg(test)]
mod tests {
    use super::*;
    #[test]
    fn test_lcm() {
        assert_eq!(lcm(12, 18), 36);
        assert_eq!(lcm(-12, 18), 36);
        assert_eq!(lcm(12, -18), 36);
        assert_eq!(lcm(-12, -18), 36);
    }
}