Sorting only using the less-than operator compared to a trivalue compare function
In C++/STL sorting is done by using only the less-than operator. Altough I have no idea how the sorting algorithms are actually implemented, I assume that the other operations are created implicite: a > b *equals* b < a == true a == b *equals* !(a < b) && !(b < a) Compared to using a trivalue* compare function, like for example Java, is this good for performance, or why was this design decision made? My assumption is that any trivalue compareto function still has to implement these comparissons in itself, resulting in the same performance. **by trivalue compare function, I mean a compare