Skip to content
Advertisement

Tag: dynamic-programming

Why is this (presumably more efficient) dynamic algorithm being outperformed by the naive recursive version?

I have the following problem as homework: Write a O(N^2) algorithm to determine whether the string can be broken into a list of words. You can start by writing an exponential algorithm and then using dynamic programming to improve the runtime complexity. The naive exponential algorithm which I started out with is this: I then adapted this into the following

Advertisement