Interested to Buy Any Domain ? << Click Here >> for more details...
When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
- 5 Answers
- 22860 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
Which is faster array or list?
Explain what are the methods available in storing sequential files ?
What are the different types of sorting in data structure?
What are different methods of collision resolution in hashing.
How do you assign an address to an element of a pointer array ?
What is a Queue? Explain its operation with example?
Can hashset contain duplicates?
What are the major data structures used in the following areas : network data model & hierarchical data model?
Define b-tree of order m?
Which collection is fail safe?
What is queue in data structure?
write a program to show the insertion and deletion of an element in an array using the position
Which sorting technique is faster?
Is binary tree balanced?
Is array static or dynamic?
