Which of the basic data structures is the most suitable if you need to access its elements by their positions in O(1) time (this is called random access)?
Answers
Answered by
1
Answer: Arrays
Explanation: when you have to access the elements by their position in O(1) time which is called random access, you need the very basic data structure (ARRAYS) to be used.
Similar questions
Social Sciences,
4 months ago
English,
4 months ago
Environmental Sciences,
8 months ago
English,
8 months ago
Social Sciences,
11 months ago
Social Sciences,
11 months ago