The time complexity is

CodePudding user response:

O (n ^ 2)
N + n - 1 + 2 + n -... * n + 1=(n + 1)/2 arithmetic series summation
So is n square

CodePudding user response:

reference 1st floor qybao response:

O (n ^ 2)
N + n - 1 + 2 + n -... * n + 1=(n + 1)/2 arithmetic series summation
So is n square

Thank you, understand,,,,,,,