Answer:
O( n ) of the 100 element array, where "n" is the item location index.
Explanation:
From the meaning of the word "sequential", the definition of this algorithm should be defined. Sequential donotes a continuously increasing value or event, like numbers, increasing by one in an arithmetic progression.
A list in programming is a mutable data structure that holds data in indexed locations, which can be accessed linearly or randomly. To sequentially access a location in a list, the algorithm starts from the first item and searches to the required indexed location of the search, the big-O notation is O( n ), where n is the index location of the item searched.
