Time complexity of code running at most summation(N) times in a loop
If i understand you correctly, then the following holds:
$\sum_{k=1}^nk= \frac{n(n+1)}{2} \ge \frac{n^2}{2} = \Theta (n^2)$

Thus there is no asymptotic gain.