When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?
- 5 Answers
- 21129 Views
- I also Faced
- E-Mail Answers
Answer Posted / pavan
If the Data structures that we are sorting are big and
located at different places then I prefer sorting pointers
rather than data itself
| Is This Answer Correct ? | 39 Yes | 4 No |
Post New Answer View All Answers
Write the postfix form of the expression: (a + b) * (c - d)
What are common data structures?
What do you mean by data and data structure?
What do you mean by double hashing?
Explain what are the types of collision resolution techniques and the methods used in each of the type?
Explain merge sort algorithms.
What do you mean by heap order property?
Briefly explain recursive algorithm?
Which sorting is best in time complexity?
How do you separate zeros from non-zeros in an array?
What the principle of quick sort and its complexity?
Can we put null key in hashmap?
What is difference between hashmap and hashset?
What is the advantage of the heap over a stack?
Why use a tuple instead of a list?
