Time complexity

Question

Let A =[a1, a2, …, an] be a one-dimensional array of integers define a MEGA-PEAK in A to be an element ai belongs A such that ai >= aj for all aj with | j – i | <= 2. What is the time complexity to find MEGA-PEAK?

Comments

Not sure O(n⁵)

Answer 1

Ans is O(n)

It will traverse for all the elements from 1 to n and for any i only 4 value of j are possible i-1,i-2,i+1,i+2 so its comparison will take constant time, its time complexity is O(n)