When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
- 5 Answers
- 21170 Views
- I also Faced
- E-Mail Answers
Answer Posted / yenealem
using pointers makes easier data manipulation on data
structuring. Therefore, when one uses array of pointers in
sorting data makes data structuring easier.Furthermore,
When pointers are arranged in array they are easier for
arithmetic operation.
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
List the abstract operations in the set?
What is fibonacci search?
What is a treemap used for?
What is data structure and why we need it?
Can you store different types in an array?
What is the Difference between sax and dom parser?
Why do we need arrays if all the operations that are performed on arrays can be performed on arraylist?
Define a set?
Can treemap key null?
Is treemap thread safe?
What is a height of a tree?
What is the Difference between treemap and hashmap?
Why do we need a data structure?
If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?
What is binary search tree and explain its time complexity?
