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
- 22917 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / pavan
If the Data structures that we are sorting are big and
located at different places then I prefer sorting pointers
rather than data itself
| Is This Answer Correct ? | 39 Yes | 4 No |
Answer / kumar gaurav
if the data structure is too large,and the pointers refer to
many data then if we sort pointers then,we can easily know
where to start at,it will be very beneficial,and sorting the
elements will take a much longer time,so sorting off
elements is not beneficial
| Is This Answer Correct ? | 4 Yes | 0 No |
Answer / 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 |
Answer / yenealem
using pointers makes easier data manipulation on data
structuring. Therefore, when one uses array of pointers in
sorting data makes data structuring easier.Furthermore,
When pointers are arranged in array they are easier for
arithmetic operation.
| Is This Answer Correct ? | 1 Yes | 0 No |
Answer / prasad
when you are using linked lists for
storing the elements.
| Is This Answer Correct ? | 6 Yes | 16 No |
What do you mean by overflow and underflow?
Define a linear data structure.
How is the front of the queue calculated in data structure?
What is the types of data structure?
For addition and deletion. Which one is most preferred: array list or linked list?
What is precision?
What is mergesort and hashtable?
What do you mean by the term “percolate down”?
Define biconnectivity?
What is difference between arraylist and list?
Can arraylist store int?
What is Jagged Arrays?
Windows 
