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
- 22716 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 time complexity of hashmap?
What is the difference between list and arraylist?
Where will be the free node available while inserting a new node in a linked list?
What is difference between hashtable and hashmap?
Can treemap key null?
Mention some drawbacks of the linked list.
What is an recursive algorithm?
Does mentioning the array name gives the base address in all the contexts?
Differentiate between compilers and interpreters.
Write the advantage of separate chaining?
Is binary tree a binary search tree?
Which is better hashmap or arraylist?
What is heap and its types?
What is the difference between b tree and binary search tree?
How is hashmap o 1?
