When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
- 5 Answers
- 21130 Views
- I also Faced
- E-Mail Answers
Answer Posted / basav (shiv shankar)
It can be used when we store data elements at the bottom.
i.e., while storing data/records at the leaf level. Here we
generally store pointers in nodes in sorted order to make
sure the linear order of records.
Example, B+ trees.
| Is This Answer Correct ? | 2 Yes | 0 No |
Post New Answer View All Answers
What are two types of sorting?
Why is hashmap not thread safe?
Why do we use a multidimensional array in data structure?
When will you use array over arraylist?
Which sorting algorithm is worst?
Why are b trees used?
What are the best data structure courses for gate preparation?
How many types of data structures are there?
What are some of the best practices relating to the java collection framework?
What is tree and its properties?
What are basic algorithms?
Can we store primitives in collections?
What is a subtree?
What is stack algorithm?
Define hash table?
