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
- 22720 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
Why is null not allowed in concurrenthashmap?
What is stack in data structure with the example?
Explain what are the major data structures used in the rdbms?
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
How do you sort a list in reverse order?
Why are b trees used?
What is hash data type?
Does treeset allow duplicates?
How would you reverse the characters of an array?
How do I use quick sort?
What is stable sorting method?
What is adt and its advantages?
Define a linear data structure.
In what areas do data structures are applied?
What are the advantages of modularity?
