Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
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?

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

What do you mean by spanning tree?

0 Answers   TCS,


How many types of data structure are there?

0 Answers  


Why null is not allowed in treemap?

0 Answers  


List some applications of tree-data structure?

0 Answers  


What is the meaning of anonymous array? Explain with an example?

0 Answers  


Explain how to find 3rd element from end in a linked list in one pass?

0 Answers  


What is the best data structure and algorithm to implement cache?

0 Answers   Adobe,


When ArrayIndexOutOfBoundsException occurs?

0 Answers  


applications of linked lists and mostly used linked list?

3 Answers  


What are the average and worst time complexity in a sorted binary tree is

0 Answers   TCS,


What is the Difference between sax and dom parser?

0 Answers  


Define a binary search tree?

0 Answers  


Categories