algorithm - Big-O algorithm

Question

enter image description here

Can anyone tell me answer for this algorithm?

I Think the answer is O(nlogn) but i’m not confident with my answer

标签： algorithmbig-o

Answer 1

它将是 n^2。因为循环给出了 n 的复杂度。和循环是嵌套的，所以它的 n*n=n^2。