When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
- 5 Answers
- 22033 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 spanning tree?does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
Explain heapsort. What is its complexity?
Why is hashset not ordered?
What is sorting explain?
What is dynamic array how it is created?
Difference between calloc and malloc in data structures?
Define an abstract data type (adt)?
How will you check the validity of an expression containing nested parentheses?
Which interfaces are implemented by abstractsequentiallist?
What is data structure and why it is important?
Tell me about the different sorting techniques.
Define double hashing?
Is quicksort a stable sorting algorithm?
which is the simplest file structure? (Sequential, indexed, random)
Which algorithm is used in collections sort method?
