Are my complexities for each step of the algorithm and overall complexity correct? void smiley (int n) { for (int i = 0; i < n; ++i) { //O(N) for (int k = 0; k < i; ++k) //O(N^2) System.out.println(k =  + k); //O(N^2) for (int j = n; j > 0; j--) //O(N^2) System.out.println(j =  + j); //O(N^2) } } 

Overall complexity: O(N + N^2 + N^2) = O(N^2)