title: Time Complexity of Insertion Sort
body: <p><strong>Could anyone explain why insertion sort has a time complexity of Θ(n²)?</strong></p>
  
  <p>I'm fairly certain that I understand time complexity as a concept, but I don't really understand how to apply it to this sorting algorithm.  Should I just look to mathematical proofs to find this answer?</p>