Z-Sorting Conundrum

I would like to take this opportunity to thank the Anonymous Poster who offered his help and advise, though I found what I considered to be a more elegant solution he still pointed me in a reasonable direction. For documentation purposes, I am going to post my solution here.

class TransparentObject {
...

bool operator< (TransparentObject& b) {
return zpos < b.zpos;
}
}
std::sort(ObjList.begin(), ObjList.end());

Any half decent STL reference will inform you that the sort algorithm can either take a less function (In the poster''s reply as a class with operator() overloaded), or will use the < operator if a less function is not specified.

If you''re sorting thousands of objects, you might want to use a radix sort, rather than STL''s standard sort, which is probably either quicksort or mergesort (can anyone confirm this?). Radix sort completes in linear time, and can be persuaded to work with floating point numbers. See here.

stl uses quicksort, with a hueristic to change it to heapsort? (I think), if the data pose a quadratic case for quicksort.