When will you sort an array of pointers to list elements,
rather than sorting the elements themselves?

Answers were Sorted based on User's Feedback



When will you sort an array of pointers to list elements, rather than sorting the elements themsel..

Answer / 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

When will you sort an array of pointers to list elements, rather than sorting the elements themsel..

Answer / kumar gaurav

if the data structure is too large,and the pointers refer to
many data then if we sort pointers then,we can easily know
where to start at,it will be very beneficial,and sorting the
elements will take a much longer time,so sorting off
elements is not beneficial

Is This Answer Correct ?    4 Yes 0 No

When will you sort an array of pointers to list elements, rather than sorting the elements themsel..

Answer / basav (shiv shankar)

It can be used when we store data elements at the bottom.
i.e., while storing data/records at the leaf level. Here we
generally store pointers in nodes in sorted order to make
sure the linear order of records.
Example, B+ trees.

Is This Answer Correct ?    2 Yes 0 No

When will you sort an array of pointers to list elements, rather than sorting the elements themsel..

Answer / 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

When will you sort an array of pointers to list elements, rather than sorting the elements themsel..

Answer / prasad

when you are using linked lists for
storing the elements.

Is This Answer Correct ?    6 Yes 16 No

Post New Answer

More Data Structures Interview Questions

How is it possible to insert different type of elements in stack?

7 Answers   TCS,


What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

3 Answers   CTS,


Is null a binary search tree?

0 Answers  


Is vector a collection?

0 Answers  


Is treeset synchronized?

0 Answers  






What is mean by abstract data type?

0 Answers  


What is a spanning tree in data structure?

0 Answers  


What is the difference between collections class vs collections interface?

0 Answers  


Tell me can the size of operator be used to tell the size of an array passed to a function?

0 Answers  


Can a binary tree be empty?

0 Answers  


Stack can be described as a pointer. Explain.

5 Answers   Wipro,


Which is faster list or set?

0 Answers  


Categories