title: Can someone explain to me why the worst case for insertion sort is O(n^2)?
body: <p>Can somebody do like a step by step explanation of how we get O(N^2) when finding the worst-case analysis of insertion sort? I'm currently reading an explanation for it from the Cormen Intro to Algorithms book, but the explanation is sort of confusing. </p>