r a vector of real-valued data and a non-negative real-valued penalty, given the square loss (to minimize) / gaussian likelihood (to maximize). Note that it is not available on CRAN (as far as I observed), and has to be fetched from the github repository.</p>
</div>
<div id="time-complexity" class="section level2">
<h2 class="hasAnchor">
<a href="#time-complexity" class="anchor"></a>Time complexity</h2>
<p>The standard optimal partitioning algorithm is quadratic in time complexity, which means the resulting