package fibonacci;

public class FibonacciImpl {
  public int calculateFibonacci(int num) {
    if (num <= 0) return 0;
    if (num == 1) return 1;

    int previous1 = 1, previous2 = 0, fib = 0;
    for (int i=2; i <= num; i++) {
      fib = previous1 + previous2;
      previous2 = previous1;
      previous1 = fib;
    }
    return fib;
  }

  public int[] calculateFibonacciRange(int start, int stop) {
    int[] results = new int[stop + 1];

    for (int x=start; x <= stop; x++) {
      results[x] = this.calculateFibonacci(x);
    }
    return results;
  }
}