title: Big Theta Notation and Selection Sort
body: <p>What would be the best-case and worst-case complexity in Big-Theta (T) notation of the selection sort algorithm when the array grows by repeatedly appending a 19? </p>
  
  <p>For instance:</p>
  
  <pre><code>[ 19, 13, 7, 19, 12, 16, 19 ],
  [ 19, 13, 7, 19, 12, 16, 19, 19 ],
  [ 19, 13, 7, 19, 12, 16, 19, 19, 19 ]
  </code></pre>
  
  <p>Et cetera. <code>n</code> is used to represent the length of the array.</p>
  
  <p>So we're adding the same number to the end of the array, but this number also happens to be the largest number so it would stay at the end of the array. Does this mean that it really doesn't have any affect on the efficiency? I'm very confused.</p>