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 |
Is collection a class or interface?
Why is reflection slower?
Can we add elements to final list?
ple.. briefly describe the purpose of having a base case and a recursive case in a recursive algorithm
What is unhashable type list?
When is a graph said to be weakly connected?
Write an algorithm for inserting and deleting an element from doubly linked list?
How do you do a heap sort?
Define collision in hashing?
What are different methods of collision resolution in hashing.
Can a binary tree be empty?
Does treeset allow duplicates?