We have a problem of size n
An algorithm that recursively solves a subproblem of size n − 1 and performs a linear amount of work on the solution.
I tried using plug n chug and found that the big-O is n, linear, but that does not seem right to me. What else could I try?