title: Example of an algorithm whose runtime is O(n^2 log n)?
body: <p>I have to construct an algorithm where it's upper bound is O(n<sup>2</sup> log n). Can anyone provide any examples on what an O(n<sup>2</sup> log n) algorithm would look like? I cannot seem to wrap my mind around it.</p>
  <p>My mental image of it would be two nested for loops and within the second loop a log n operation is performed. Is this correct?</p>