Printable View
Suppose I have an std::list with several values.
How do I sort them from the smallest to the largest and vice versa? Inside the list. So for example, before soring, my list would have:
2
5
1
7
4
And afterwards, they are sorted:
1
2
4
5
7
I know about the qsort algorithm, but can someone tell me how to actually use it on a list?
Thanks
>I know about the qsort algorithm, but can someone tell me how to actually use it on a list?<
You don't (it wouldn't work). std::list has its own sorting algorithm - std::list::sort. However, if sorting plays a large role in whatever you're doing, you may want to look at an alternative data structure.
Yes, sorting must be fast since I plan to use it in my 3d engine to sort objects by their depth and render them from back to front.
What do you suggest? My object class has a getposition() function, so I can get the Z from there, I should sort the objects relative to their Z value. What would you do?
Sorry don't know much about graphics programming (aside from using the hardware z-buffer). You could take a look at -
http://www.google.com/search?hl=en&i...ffer+algorithm
Or ask on the game programming forum.
My question is related with graphics programming, but it is just a sorting question.
Would list::sort work for sorting the values of the list?
>Would list::sort work for sorting the values of the list?<
Yes. But how often are you sorting? If it is often you will be much better off using a array/vector or some form of (associative) tree.
I said it is in the game loop, so really often. I could osrt whever the object's Z is changed though, that would be much more efficient.
I think, for short lists like yours, the built in sort will be good enough.