><span class="p">(</span><span class="n">NlogN</span><span class="p">)</span></code> time in the common case. However, given an extremely lopsided partition at every step of the recursion, the algorithm will degrades into its worst case performance of <code class="language-c++ highlighter-rouge"><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>. What are those inputs that produce such unbalanced partitioni