 complexity of this algorithm (it being a reference implementation) is quadratic as well.</p>
<p>However, there are several ways to speed up the dynamic programming algorithms including the pruning of the solution space, and the algorithms which provide a faster (log-linear time) implementation of the same include:</p>
<ul>
<li><p><code><a href="https://rdrr.io/pkg/changepoint/man/cpt.mean.html">changepoint::cpt.mean</a></code>, which provides <code>cpt.mean</code> and other functions which compute the opti