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
- 22719 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
Where is insertion sort used?
Which sorting technique is best?
How to sort 1 million floating point numbers?
What is merge sort in daa?
What is the top of a stack?
Which is faster quick sort or merge sort?
How can you represent a linked list node?
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
What is the Difference between treemap and hashmap?
How to fill element (initialize at once) in an array?
Define circular list?
Differentiate between set and map.
What is bubble sort technique?
What is an externalizable interface?
What is the complexity of selection sort?
