When dealing with time series data, which type of data structure is most efficient for sequential access and why?

  • Array
  • Linked List
  • Queue
  • Stack
An array is most efficient for sequential access in time series data. This is because arrays provide direct access to elements based on their indices, making it faster to retrieve data points in sequential order. Linked lists involve traversal, while queues and stacks are not as suitable for direct access.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *