When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
- 5 Answers
- 21192 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 shell sort in data structure?
What is the difference between hashset and treeset?
Does hashmap maintain insertion order?
Why is merge sort faster?
Define a relation?
Describe tree database. Explain its common uses.
Differentiate among cycle, path, and circuit?
What are threaded binary trees?
What is java priority queue?
State the demerits of linked representation of binary trees?
What is a weighted graph?
Why arraylist is not efficient for manipulation?
Is quicksort recursive?
What is a queue in data structure?
Where is data structure used?
