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
- 22913 Views
- I also Faced
- E-Mail Answers
Answer Posted / pavan
If the Data structures that we are sorting are big and
located at different places then I prefer sorting pointers
rather than data itself
| Is This Answer Correct ? | 39 Yes | 4 No |
Post New Answer View All Answers
State the advantages of using infix notations?
Differentiate stack from array?
Describe full binary tree and complete binary tree.
How can you add an item to the beginning of the list?
What is bubble sort and quick sort?
Why is data structure needed?
How do you insert a new item in a binary search tree?
What do you mean by union-by-weight?
How are elements stored in hashset?
Is hashmap synchronized?
What is an recursive algorithm?
How is heap sort implemented?
What is return map?
How does variable declaration affect memory allocation?
Describe avl tree or height balanced binary search tree.
