Job offersCompaniesTestsBlogI'm an employerSign upLog in
Home>IT Tests>Questions>Given a list of unsorted elements, what is the best data structure to store them in order to minimize the cost of accessing them?

Question from the Algorithmics - Fundamentals test

Given a list of unsorted elements, what is the best data structure to store them in order to minimize the cost of accessing them?

Medium

If we have a list of unsorted elements and we want the cost of accessing the elements to be as low as possible, what is the best structure that can contain these elements?

Author: KahinaStatus: PublishedQuestion passed 138 times
Edit
0
Community EvaluationsNo one has reviewed this question yet, be the first!
Similar Questions
More questions about Algorithme
7
What is recursion?
4
What is special about quick sort?
4
What type of structure are the results of a recursive function stored in?
1
What about the merge sort method?
1
Given an array of 17 elements sorted in ascending order, what is the cost of accessing the element with index 10?