When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
- 5 Answers
- 21166 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
What is a vector class?
What is difference between set and map?
Describe tree database.
Which is faster list or set?
Differentiate between set and map.
What is ds tree?
Define depth and height of a tree?
Differentiate between arraylist and linkedlist.
Explain extended binary tree.
What are AVL trees?
In tree construction which is the suitable efficient data structure?
What is array in data structure with example?
What is the minimization factor and time complexity of b-tree?
Is pointer a variable?
Why heap sort is not used?
