Ackermann's Function

Joshua:

Thanks for all your feedback. Flake8 is now running on my editor, so I will
now be PEP 8 compliant. I will use for loops for my testing in the future.

-Henry

On Wed, Dec 3, 2014 at 10:49 AM, Joshua Frailey <notifications@github.com>
wrote:

> In Students/HenryGrantham/session02/series.py:
>
> > +       where n is an integer >  0.
> > +       If n is less than 1, return None
> > +       a and b are the first and second numbers in the series.
> > +    """
> > +    if n == 1 :
> > +        return a
> > +    elif n == 2:
> > +        return b
> > +    elif n > 2:
> > +        return sum_series(n-2, a, b) + sum_series(n-1, a, b)
> > +    else:
> > +        return None
> > +
> > +if __name__ == "__main__":
> > +    assert fibonacci(-1) == None
> > +    assert fibonacci(0) == None
>
> I really like seeing these two assertions since None is a possible output
> of your function. Without these I'd consider your testing to be path
> incomplete.
>
> —
> Reply to this email directly or view it on GitHub
> <https://github.com/codefellows/sea-c28-students/pull/41/files#r21254432>.
>



-- 
-Henry
(206)265-2350