Interested to Buy Any Domain ? << Click Here >> for more details...
When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
- 5 Answers
- 22853 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 method removes the value from the top of a stack?
Can you list out the areas in which data structures are applied extensively?
Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.
What is return map?
What is entryset in hashmap?
What is the difference between collection and collections?
What is declaring array?
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
What is difference between tree and binary tree?
Why do we need linked lists?
What is a stable sorting algorithm?
Explain the Linked List
What is application of data structure?
What is unmodifiable list?
What is list data structure?
