Question

In a data analysis scenario involving a fixed-size dataset where elements need to be accessed frequently by their position, which data structure is generally most efficient for direct element access?

A Linked List
B Hash Table
C Array
D Binary Search Tree
E Queue
Practice Next

Hey! Ask a query