Algorithmic complexity of naive code for processing all consecutive subsequences of a list: n^2 or n^3?

Question

I\'m studying for a test and found this question:

I can\'t really determine the complexity, I figured it\'s either O(n²) or O(n³) and I\'m lea

Answer 1

No matter triangle shape or not, it always a complexity O(N^3), but of course with lower constant then a full triple nested cycles.