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
- 22888 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
You want to insert a new item in a binary search tree. How would you do it?
What is an algorithm in coding?
What is a treemap used for?
What is collision in data structure?
What is sorted map?
Can arraylist be resized?
Does arraylist contain duplicates?
Is duplicate allowed in hashmap?
How to sort 1 million floating point numbers?
How to use appendNode() in linkedlist()?
Explain exception filter?
How do I sort hashset?
What is mean by merge sort?
Which is faster hashmap or concurrenthashmap?
Which sorting algorithm is the slowest?
