title: Why a programmer would prefer O(N^3) instead of O(N^2)
body: <p>I was studying for my final exam and there is a question in the archive that I cannot find its answer:</p>
  
  <blockquote>
    <p>The order-of-growth of the running time of one algorithm is O(N^2); the
    order-of-growth of the running time of a second algorithm is O(N^3). List
    three compelling (logical, convincing) reasons why a programmer would
    prefer to use the O(N^3) algorithm instead of the O(N^2) one.</p>
  </blockquote>