rosalind 0.2.0

Crate contains solutions of problems published on Rosalind.info
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
28
29

//! Module for `Rabbits and Recurrence Relations`

/// This function calculates recurrence relation, or value of element at `n` position
/// in Fibonaccie's sequence
///
/// # Examples
/// ```
/// use rosalind::fib::*;
///
/// assert_eq!(recurrence_relation(5, 3), 19);
/// ```
#[allow(unused_variables)]
pub fn recurrence_relation(n: u8, k: u8) -> u16 {
  let mut pair: (u16, u16) = (1, 1);
  for i in 0..n - 1 {
    pair = (pair.1, pair.0 * k as u16 + pair.1)
  }
  return pair.0;
}

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

  #[test]
  fn it_should_return_recurrence_relation() {
    assert_eq!(recurrence_relation(5, 3), 19);
  }
}