When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
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 |
How do you sort an array in decreasing order?
What is the best case time complexity of bubble sort?
How will you free the memory that is allocated at run time?
Define an algorithm. What are the properties of an algorithm?
Can sets contain duplicates?
Explain what are the methods available in storing sequential files ?
List the area of applications where stack data structure can be used?
What are the advantages of binary search over linear search?
What are the Differences between map and hashmap?
Can map contain duplicate keys?
What is dequeue in data structure?
What do you mean by separate chaining?