When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
- 5 Answers
- 22042 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
Is array a data type?
What are the advantages of selecetion sort?
What are b tree keys?
State the merits of linear representation of binary trees?
What is collection process?
In tree construction which is the suitable efficient data structure?
What is peek in stack?
Which interfaces are implemented by linkedlist?
How many pointers are necessary to implement a simple linked list?
Define level of the tree?
What is a vector class?
What is the minimum number of queues that can be used to implement a priority queue?
How does selection sort work?
Give a basic algorithm for searching a binary search tree?
Why is an array homogeneous?
