reducing time complexity of 3 loops in python o(n^3)

Question

Closed. This question needs to be more focused. It is not currently accepting answers. question from:https://stackoverflow.com/questions/65643683/reducing-time-complexity-of-3-loops-in-python-on3

Answer 1

It's actually the sum of the array's elements, to the power of 3. It could be implemented very easily:

summ = sum(arrn)**3

Which is O(n), since you access each of the elements once.