+1 vote
in Data Structures & Algorithms I by (110k points)
It is not possible to find the minimum number of steps to reach the end of an array in linear time.

(a) true

(b) false

I'm obligated to ask this question of Number of Jumps to Reach End-array Operation topic in portion Arrays Types of Data Structures & Algorithms I

This question was posed to me by my school teacher while I was bunking the class.

1 Answer

+1 vote
by (408k points)
selected by
 
Best answer
Right answer is (b) false

Easy explanation - It is possible to find the minimum number of steps to reach the end of an array in O(n) time complexity. So it is the fastest possible method of finding the minimum number of steps to reach the end of an array.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...