Why the memo changes so much

• A

  O(n log n), because the memo is a lookup structure

• B

  O(n), because each of the n distinct values is computed once

• C

  O(n squared), because each value still looks at earlier ones

• D

  Still exponential, but with a much smaller constant