><span class="n">O</span><span class="p">(</span><span class="n">N</span><span class="o">^</span><span class="mi">2</span><span class="p">)</span></code>. Verify you can achieve <code class="language-c++ highlighter-rouge"><span class="n">O</span><span class="p">(</span><span class="n">N</span><span class="p">)</span></code> results on inputs constructed to play to its strengths.</p>
</div>

<p>The QuickSort algorithm runs in a competitive <code class="language-c++ highlighter-rouge"><span class="n">O</span