What is the minimum possible time complexity to find the number of steps to reach the end of an array?
(a) O(n)
(b) O(n^2)
(c) O(n^3/2)
(d) O(1)
My question comes from Number of Jumps to Reach End-array Operation topic in chapter Arrays Types of Data Structures & Algorithms I
I have been asked this question during an interview.