#ifndef FUNCTIONS_H
#define FUNCTIONS_H

#include <iostream>

class RecursiveFunctions {
public:
    static long factorial(int n); // integer n returns its factorial as a long
    static int fibonacci(int n); // integer n returns the nth term in the fibonacci sequence
    static double power(double base, int exponent); //double base and an integer exponent returns base raised to the exponent power
};

#endif