B
boltar2003
Hi
If I have a list of *pointers* to objects that I need to store that will be
sorted based on values within each object , which will be quicker - sorting
a vector of pointers or sorting a list? Since the vector only needs to make
3 pointer copies to swap values whereas a doubly linked list will have to
update a lot more prev/next pointers I'm guessing it will be the vector but
I'm not 100% hence I'm asking the experts on this group.
Thanks for any help.
B2003
If I have a list of *pointers* to objects that I need to store that will be
sorted based on values within each object , which will be quicker - sorting
a vector of pointers or sorting a list? Since the vector only needs to make
3 pointer copies to swap values whereas a doubly linked list will have to
update a lot more prev/next pointers I'm guessing it will be the vector but
I'm not 100% hence I'm asking the experts on this group.
Thanks for any help.
B2003