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
- 22785 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 quick sort or merge sort?
How is a queue works?
What is peek in stack?
Which is more efficient merge sort vs quicksort?
Why do we need a data structure?
What is the slowest sorting algorithm?
What is the best case complexity of bubble sort?
What is sorting an array?
Is hashtable fail fast?
How many types of linked list exist?
Are linked lists considered linear or non-linear data structures?
Does treemap allow duplicate keys?
By Which algorithm, the 8 queens problem is solved?
Is file a data structure?
Is list a data type?
