When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
- 5 Answers
- 21131 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
What are the applications of graph data structure?
Differentiate between the singly linked list and doubly linked list.
What are the applications of priority queues?
How do you find the index of an element in an arraylist?
Differentiate between collection and collections.
What do you mean by data types?
How do you clear a stack?
Can you declare an array without assigning the size of an array?
Is hashtable fail fast?
What do you mean by data and data structure?
What are the advantages of linked list over array (static data structure)?
What is mean by sorting?
Is quicksort recursive?
What is difference between hashmap and hashset?
What is stack and queue in data structure?
