When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
- 5 Answers
- 21127 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 binary search tree and explain its time complexity?
What is mean by sorting?
List the data structures which are used in rdbms, network data modal, and hierarchical data model.
What is the space complexity of selection sort?
Define 2-3 tree?
How do you sort an array in descending order?
Which is faster hashmap or treemap?
What is the difference between static and dynamic data?
What is m way tree in data structure?
What is internal and external sorting?
Is binary tree a binary search tree?
How do you use the sort function?
Why do we use dynamic arrays?
What are AVL trees?
What type of algorithm is binary search?
