Its [[Worst-case Running Time of Algorithm]] is given by $\sum_{i-1}^{n-1} \Theta(n-i) = \Theta(n^{2})$